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.