Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 2020 Aug 1:2020:3607547.
doi: 10.1155/2020/3607547. eCollection 2020.

Algorithms for Investment Project Distribution on Regions

Mafawez Alharbi  1 , Mahdi Jemmali  1   2
Affiliations

Algorithms for Investment Project Distribution on Regions

Mafawez Alharbi et al. Comput Intell Neurosci. .

Abstract

This paper proposes an optimization system for solving an NP-hard problem by using several new algorithms and application programs. This study aims to identify a suitable distribution of investment projects across several developed industrial regions. It is assumed that all industrial regions involved have the same economic and strategic characteristics. The problem involves a set of projects that are to be assigned across regions. Each project creates an estimated number of new jobs, and the distribution of projects can be guided by minimizing the maximum total number of newly created jobs. The problem is NP-hard one, and it is difficult to determine the most appropriate distribution. We apply scheduling algorithms in order to solve the analyzed problem. Severalheuristics are developedto obtain the appropriate distribution of newly created jobs across all regions. A branch-and-bound method is employed in order to obtain the exact solution. The performance of the algorithm is demonstrated by the experimental results for a total number of 1850 instances.

PubMed Disclaimer

Conflict of interest statement

The authors declare that there are no conflicts of interest regarding the publication of this paper.

Figures

Figure 1
Figure 1
Assignment in instance 1.
Figure 2
Figure 2
Rearrangement for instance 1.
Figure 3
Figure 3
Schedule after applying NIJ in instance 1.
Figure 4
Figure 4
Variation of AGAPu according to np.
Figure 5
Figure 5
Variation of the GAPlu value according to np.
Figure 6
Figure 6
Variation of NS according to n/m.
Algorithm 1
Algorithm 1
MFJ algorithm.
See this image and copyright information in PMC

References

    1. Haouari M., Jemmali M. Maximizing the minimum completion time on parallel machines. 4OR. 2008;6(4):375–392. doi: 10.1007/s10288-007-0053-5. - DOI
    1. Haouari M., Jemmali M. Tight bounds for the identical parallel machine-scheduling problem: part II. International Transactions in Operational Research. 2008;15(1):19–34. doi: 10.1111/j.1475-3995.2007.00605.x. - DOI
    1. Walter R., Wirth M., Lawrinenko A. Improved approaches to the exact solution of the machine covering problem. Journal of Scheduling. 2017;20(2):147–164. doi: 10.1007/s10951-016-0477-x. - DOI
    1. Alexiadis S. Regional allocation of investment: implications for regional policy. Procedia Economics and Finance. 2014;9:176–180. doi: 10.1016/s2212-5671(14)00018-5. - DOI
    1. Ohtsuki Y. Regional allocation of public investment in an n-region economy∗. Journal of Regional Science. 1971;11(2):225–233. doi: 10.1111/j.1467-9787.1971.tb00253.x. - DOI

MeSH terms

LinkOut - more resources