Fundamental Research Funds for the Central Universities [CCNU20TS026]
机构署名：
本校为第一且通讯机构
院系归属：
计算机学院
摘要：
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 (rang...
