Multi-Objective Ant Colony Optimization Based on the Physarum-Inspired Mathematical Model for Bi-Objective Traveling Salesman Problems |
| |
| Authors: | Zili Zhang Chao Gao Yuxiao Lu Yuxin Liu Mingxin Liang |
| |
| Affiliation: | 1. College of Computer and Information Science & College of Software, Southwest University, Chongqing 400715, China.; 2. School of Information Technology, Deaken University, Locked Bag 20000, Geelong, VIC 3220, Australia.; 3. Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, Changchun 130012, China.; Kyushu University, JAPAN, |
| |
| Abstract: | Bi-objective Traveling Salesman Problem (bTSP) is an important field in the operations research, its solutions can be widely applied in the real world. Many researches of Multi-objective Ant Colony Optimization (MOACOs) have been proposed to solve bTSPs. However, most of MOACOs suffer premature convergence. This paper proposes an optimization strategy for MOACOs by optimizing the initialization of pheromone matrix with the prior knowledge of Physarum-inspired Mathematical Model (PMM). PMM can find the shortest route between two nodes based on the positive feedback mechanism. The optimized algorithms, named as iPM-MOACOs, can enhance the pheromone in the short paths and promote the search ability of ants. A series of experiments are conducted and experimental results show that the proposed strategy can achieve a better compromise solution than the original MOACOs for solving bTSPs. |
| |
| Keywords: | |
|
|
