| dc.contributor.author | Jemmali, Mahdi | |
| dc.date.accessioned | 2021-10-14T10:56:06Z | |
| dc.date.available | 2021-10-14T10:56:06Z | |
| dc.date.issued | 2021-10-05 | |
| dc.identifier.citation | ADCAIJ: Advances in Distributed Computing and Artificial Intelligence Journal, 10 (2021) | |
| dc.identifier.issn | 2255-2863 | |
| dc.identifier.uri | http://hdl.handle.net/10366/147245 | |
| dc.description.abstract | This paper aims to find an efficient method to assign different projects to several regions seeking an equitable distribution of the expected revenue of projects. The solutions to this problem are discussed in this paper. This problem is NP-hard. For this work, the constraint is to suppose that all regions have the same socio-economic proprieties. Given a set of regions and a set of projects. Each project is expected to elaborate a fixed revenue. The goal of this paper is to minimize the summation of the total difference between the total revenues of each region and the minimum total revenue assigned to regions. An appropriate schedule of projects is the schedule that ensures an equitable distribution of the total revenues between regions. In this paper, we give a mathematical formulation of the objective function and propose several algorithms to solve the studied problem. An experimental result is presented to discuss the comparison between all implemented algorithms. | |
| dc.format.mimetype | application/pdf | |
| dc.publisher | Ediciones Universidad de Salamanca (España) | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.subject | Approximate solution | |
| dc.subject | Regional development | |
| dc.subject | Project distribution | |
| dc.subject | Algorithms | |
| dc.title | Projects Distribution Algorithms for Regional Development | |
| dc.type | info:eu-repo/semantics/article | |
