区域发展的项目分配算法

IF 1.7 Q3 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
M. Jemmali
{"title":"区域发展的项目分配算法","authors":"M. Jemmali","doi":"10.14201/adcaij2021103293305","DOIUrl":null,"url":null,"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.","PeriodicalId":42597,"journal":{"name":"ADCAIJ-Advances in Distributed Computing and Artificial Intelligence Journal","volume":"11 1","pages":""},"PeriodicalIF":1.7000,"publicationDate":"2021-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Projects Distribution Algorithms for Regional Development\",\"authors\":\"M. Jemmali\",\"doi\":\"10.14201/adcaij2021103293305\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":42597,\"journal\":{\"name\":\"ADCAIJ-Advances in Distributed Computing and Artificial Intelligence Journal\",\"volume\":\"11 1\",\"pages\":\"\"},\"PeriodicalIF\":1.7000,\"publicationDate\":\"2021-10-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ADCAIJ-Advances in Distributed Computing and Artificial Intelligence Journal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.14201/adcaij2021103293305\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ADCAIJ-Advances in Distributed Computing and Artificial Intelligence Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14201/adcaij2021103293305","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 13

摘要

本文旨在寻找一种有效的方法,将不同的项目分配到不同的地区,以求得项目预期收益的公平分配。本文讨论了解决这一问题的方法。这个问题是np困难的。对于这项工作,限制是假设所有地区都具有相同的社会经济属性。给定一组区域和一组项目。每个项目都有固定的收入。本文的目标是使每个地区的总收入与分配给地区的最小总收入之间的总差之和最小。一个适当的项目进度表是确保在地区之间公平分配总收入的进度表。本文给出了目标函数的数学表达式,并提出了几种算法来解决所研究的问题。给出了一个实验结果,讨论了所有实现算法之间的比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Projects Distribution Algorithms for Regional Development
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.40
自引率
0.00%
发文量
22
审稿时长
4 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信