ISSN 1000-1239 CN 11-1777/TP

• 人工智能 •

### 混合算法求解多目标平衡旅行商问题

1. (武汉大学计算机学院 武汉 430072) (dxs_cs@163.com)
• 出版日期: 2017-08-01
• 基金资助:
国家自然科学基金项目(61672024,61170305)

### Hybrid Algorithms for Multi-Objective Balanced Traveling Salesman Problem

Dong Xueshi, Dong Wenyong, Wang Yufeng

1. (Computer School, Wuhan University, Wuhan 430072)
• Online: 2017-08-01

Abstract: Balanced traveling salesman problem (BTSP), a variant of traveling salesman problem (TSP), is another combination optimization problem, which can be applied in many fields such as the optimization problem for gas turbine engines (GTE). BTSP can only model optimization problems with the single traveling salesman and task, but can’t model and optimize the problem with multiple salesmen and tasks at the same time. Therefore, this paper firstly provides a multi-objective balanced traveling salesman problem (MBTSP) model, which can model the optimization problems with multiple salesmen and tasks. Specifically it can be applied to the real-world problems with multiple objectives or individuals, for example, the optimization for multiple GTE. Some literatures have proved that ITO algorithm and genetic algorithms can show better performance in solving combination optimization problems, therefore, the paper utilizes the hybrid ITO algorithm (HITO) and hybrid genetic algorithm (GA) to solve MBTSP. For HITO, it utilizes ant colony optimization (ACO) to produce a probabilistic generative model based on graph, and then uses the drift and volatility operators to update the model, and obtains optimum solution. For the hybrid GA, the first is improved by greedy method called GAG, the second GA is optimized by incorporating hill-climbing named GAHC, and the final one is GASA. In order to effectively test the algorithms, the paper makes extensive experiments using small scale to large scale MBTSP data. The experiments show that the algorithms are effective and reveal the different characteristics in solving MBTSP problem.