Improved Genetic Algorithm for Multi-agent Task Allocation with Time Windows

Juan Li, Ning Fang
{"title":"Improved Genetic Algorithm for Multi-agent Task Allocation with Time Windows","authors":"Juan Li, Ning Fang","doi":"10.1109/ICMA54519.2022.9856377","DOIUrl":null,"url":null,"abstract":"Task allocation is a very important part of multi-agent systems. When assigning tasks to one of the agents in multi-agent systems, many constraints need to be considered to achieve optimal allocation results. In this paper, an improved genetic algorithm (GA) is proposed to solve the multi-agent task allocation with time window constraints. Firstly, the mathematical model of task allocation is established, and the constraint problem of time window is analyzed. The penalty function method is used to deal with the constraint condition. Secondly, the improved Large Neighborhood Search (LNS) is added to the local search to increase the diversity of population, which can make the algorithm easier to jump out of local optimum. Then genetic algorithm is used to solve the multi-agent task allocation problem with time window constraints. Finally, the simulation verifies the optimization performance of the improved algorithm.","PeriodicalId":120073,"journal":{"name":"2022 IEEE International Conference on Mechatronics and Automation (ICMA)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Conference on Mechatronics and Automation (ICMA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMA54519.2022.9856377","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Task allocation is a very important part of multi-agent systems. When assigning tasks to one of the agents in multi-agent systems, many constraints need to be considered to achieve optimal allocation results. In this paper, an improved genetic algorithm (GA) is proposed to solve the multi-agent task allocation with time window constraints. Firstly, the mathematical model of task allocation is established, and the constraint problem of time window is analyzed. The penalty function method is used to deal with the constraint condition. Secondly, the improved Large Neighborhood Search (LNS) is added to the local search to increase the diversity of population, which can make the algorithm easier to jump out of local optimum. Then genetic algorithm is used to solve the multi-agent task allocation problem with time window constraints. Finally, the simulation verifies the optimization performance of the improved algorithm.
带时间窗的多智能体任务分配改进遗传算法
任务分配是多智能体系统的一个重要组成部分。在多智能体系统中,将任务分配给其中一个智能体时,需要考虑许多约束条件以获得最优的分配结果。提出了一种改进的遗传算法(GA)来解决具有时间窗约束的多智能体任务分配问题。首先,建立了任务分配的数学模型,分析了时间窗的约束问题。采用罚函数法处理约束条件。其次,在局部搜索中加入改进的大邻域搜索(Large Neighborhood Search, LNS),增加种群的多样性,使算法更容易跳出局部最优;然后利用遗传算法解决了具有时间窗约束的多智能体任务分配问题。最后通过仿真验证了改进算法的优化性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
文献相关原料
公司名称 产品信息 采购帮参考价格
×
引用
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学术官方微信