The Optimization of Transportation course by GA incorporated with Saving-Method
Nobunori Aiura, Keiichi Satoh, Yutaka Karasawa, Takatomo KAMATSU · INFRASTRUCTURE PLANNING REVIEW · 2001
In this paper, we give a solution for traveling salesman n person M town problem (TSP (n/M)) which is an extension of traveling salesman problem (TSP) by the genetic algorithm (GA). TSP (n/M) is a generalized problem of the ordinary traveling salesman to a problem when n person exists. Here, we propose a new algorithm named multi-parents exchange method that generates one offspring from several parents. Moreover, we propose a new method by combining this algorithm with the Saving Method is a method in the area of The Transportation Planning.