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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
