Solving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm
محورهای موضوعی : Design of Experiment
Hossein Larki
1
(a Phd Student, Young Researchers & Elite Club, Hamedan Branch, Islamic Azad University, Hamedan, Iran)
Majid Yousefikhoshbakht
2
(Assistant Professor, Department of Mathematics, Bu-Ali Sina University, Hamedan, Iran)
کلید واژه: Multiple Traveling Salesman Problem, NP-hard Problems, Imperialist Competitive Algorithm, Lin-Kernigan Algorithm,
چکیده مقاله :
The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Although the MTSP is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. This paper presents an efficient and evolutionary optimization algorithm which has been developed through combining Modified Imperialist Competitive Algorithm and Lin-Kernigan Algorithm (MICA) in order to solve the MTSP. In the proposed algorithm, an absorption function and several local search algorithms as a revolution operator are used. The performance of our algorithm was tested on several MTSP benchmark problems and the results confirmed that the MICA performs well and is quite competitive with other meta-heuristic algorithms.
