Heuristic Algorithms for Bi-objective Traveling Salesman Problem

摘要：

In this paper we discuss about solving the bi-objective traveling salesman problem. We assumed there are two data matrixes, the cost and distance of traveling from a city to its neighbor. Our objectives are minimizing the costs and the distances of traveling. The cost and the distance of traveling are independent and no relation is there between them. We adapted the Nearest Neighbor Heuristic which has been given for solving a single objective TSP and reached to a heuristic for solving a bi-objective TSP. Also, we developed a genetic algorithm for solving the problem. We gave this genetic algorithm based on Pareto elitist-selection method. We have tested these methods on some generated random instances and some instances which are available on TSPLIB.

关键词： TSP bi-objective Genetic algorithm

作者: Fariborz JOLAI Mohammad YAZDANI

作者单位: Industrial Engineering Department,Faculty of Engineering,University of Tehran,Tehran,Iran

会议类型: 国际会议

会议名称: 工业工程与系统管理2007年国际会议(International Conference on Industrial Engineering and Systems Management)(IESM 2007)

会议地点: 北京

会议语种:英文

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