A Genetic Algorithm with New Local Operators for Multiple Traveling Salesman Problems
Multiple Traveling Salesman Problem (MTSP) is able to model and solve various real-life applications such as multiple scheduling, multiple vehicle routing and multiple path planning problems, etc. While Traveling Salesman Problem (TSP) focuses on searching a path of minimum traveling distance to vis...
Main Authors: | , , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Atlantis Press
2018-01-01
|
Series: | International Journal of Computational Intelligence Systems |
Subjects: | |
Online Access: | https://www.atlantis-press.com/article/25892521/view |