摘要
Constructing a finite set of candidates for each node has been proved that it is an effective means in ant colony optimization (ACO) for solving the travelling salesman problem (TSP). However, some neighbor nodes in the optimal routes are two nodes with large separation distance. To solve this problem, this paper proposes an ACO with pre -exploration of outliers (ACO-EO). The techniques in ACO-EO include: a) the outliers selection, b) pre -exploration adjacent nodes for outliers. To verify the effectiveness of the ACO-EO, a number of experiments are conducted using 30 benchmark instances (ranging from 101 nodes to 1784 nodes in topologies) taken from the well-known TSPLIB. From the comparison with state-of-the-art ACO-based methods, ACO-EO outperforms these competitors in terms of convergence and solution accurancy.
学科与关键词
- Adaptive Ant Colony Optimization with node clustering applied to the Travelling Salesman ProblemStodola, Petr*; Otrisal, Pavel; Hasilova, KamilaSwarm and Evolutionary Computation, 2022, 70: 101056.被引 33
- An Improved Ant Colony Optimization Based on an Adaptive Heuristic Factor for the Traveling Salesman ProblemDu, Pengzhen*; Liu, Ning; Zhang, Haofeng; Lu, JianfengJOURNAL OF ADVANCED TRANSPORTATION, 2021, 2021: 6642009.被引 11
- Multiple ant colony optimization using both novel LSTM network and adaptive Tanimoto communication strategyLi, Shundong; You, Xiaoming*; Liu, ShengApplied Intelligence, 2021, 51(8): 5644-5664.被引 13
