1. Multiple Traveling Salesman Problem with Precedence Constraints Based on Modified Dynamic Tabu Artificial Bee Colony Algorithm
- Author
-
Ziyue Chen, Linyi Xia, Huifeng Shan, and Wenqi Zhong
- Subjects
Mathematical optimization ,business.industry ,Heuristic (computer science) ,Process (computing) ,Library and Information Sciences ,2-opt ,Computer Graphics and Computer-Aided Design ,Travelling salesman problem ,Artificial bee colony algorithm ,Computational Theory and Mathematics ,Artificial intelligence ,business ,Information Systems ,Mathematics - Abstract
The combination of MTSP and TSPPC, Multiple Traveling Salesman Problem with precedence constraints, leads to the difficulty of solving problem in practical such as industrial production, logistics transportation and semiconductors. Several methods, including heuristic method, were introduced to solve problems related to MTSP and TSPPC. By redefining the optimal-solution searching process of Dynamic Tabu Artificial Bee Colony algorithm, MTSPPC problem could be solved. The results illustrated that the redefined-optimal-solution-searching-process-based Dynamic Tabu Artificial Bee Colony algorithm is suitable for solving MTSPPC problem.
- Published
- 2014
- Full Text
- View/download PDF