An Approach to Solve Large Scale Multiple Traveling Salesman Problem with Balanced Assignment

摘要：

A special case of multiple traveling salesman problem which requests the cities each traveling salesman visited to be the same and the total tour length to be minimized is calculated by Lin-Kernighan algorithm with a two stage procedure. The calculation result is satisfactory.

关键词： TSP MTSP Lin-Kernighan algorithm

作者: Wang Dazhi Wang Dingwei

作者单位: College of Information Science and Engineering, Northeastern University, P.R.China, 110004

会议类型: 国际会议

会议名称: 第六届管理学国际会议(Proceedings of ICM2007 the 6th International on Management)

会议地点: 武汉

会议语种:英文

页码: 43-45

在线出版日期: 2007-08-03（万方平台首次上网日期，不代表论文的发表时间）