Algorithms for Investment Project Distribution on Regions

Abstract EN

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.