Genetic algorithm for solving a new multiple traveling salesman problem with partially overlapped domains

作     者：Sun, Qirui Li, Jun Ding, Jian Dai, Xianzhong 

作者机构：Key Laboratory of Measurement and Control of Complex Systems of Engineering Ministry of Education Southeast University Nanjing 210096 China 

出 版 物：《Zhongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Central South University (Science and Technology)》 (Zhongnan Daxue Xuebao (Ziran Kexue Ban))

年 卷 期：2013年第44卷第SUPPL.1期

页      面：69-74页

核心收录：

主　　题：Traveling salesman problem 

摘      要：From the scheduling problem of dual-bridge water-jet cutting system, a new multiple traveling salesman problem called overlapped multiple traveling salesman problem (OMTSP) was extracted and purified, a method was proposed based on a genetic algorithm. The algorithm provides a double chromosomes of city and salesman encoding solution, and designs appropriate crossover and mutation operators. The results show that the algorithm enjoys rapid converge and can achieve a good solution of OMTSP.