{"title":"带时间窗的多智能体任务分配改进遗传算法","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":"{\"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}","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}
Improved Genetic Algorithm for Multi-agent Task Allocation with Time Windows
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.