关键词: 多目标优化 TSP 支配解

Abstract:

In logistics application, the traditional TSP is a single-objective optimization problem denoting the shortest path. It can be converted to a multi-ob jective optimization problem through calculating the cost loss of the time window. When the time window cost model is built,the Pareto front of this pro blem can be solved by the genetic algorithm based on the domination rank. The efficiency of this process is validated by experimental data.

Key words: multi-objective optimization, traveling salesman problem（TSP）;domination solution