| [1] |
LI J , ZHOU M C , SUN Q , et al. Colored traveling salesman problem[J]. IEEE Transactions on Cybernetics, 2015,45(11): 2390-2401.
|
| [2] |
LI J , QIRU S , ZHOU M C , et al. A new multiple traveling salesman problem and its genetic algorithm-based solution[C]// The 2013 IEEE International Conference on Systems Man and Cybernetics, 2013: 1-6.
|
| [3] |
MENG X H , LI J , DAI X Z , et al. Variable neighborhood search for a colored traveling salesman problem[J]. IEEE Transactions on Intelligent Transport Systems, 2018,19(4): 1018-1025.
|
| [4] |
DONG X S , DONG W Y , CAI Y L . Ant colony optimization for colored traveling salesman problem by multi-task learning[J]. IET Intelligent Transport Systems, 2018,12(8): 774-782.
|
| [5] |
KAO M Y , SANGHI M . An approximation algorithm for a bottleneck traveling salesman problem[J]. Journal of Discrete Algorithms, 2009,7(3): 315-326.
|
| [6] |
LARUSIC J , PUNNEN A P . The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis[J]. Computer & Operation Research, 2014,43:20-35.
|
| [7] |
AHMED Z H . A hybrid genetic algorithm for the bottleneck traveling salesman problem[J]. ACM Transactions on Embedded Computing Systems, 2013,12(1):9:1-9:10.
|
| [8] |
VAIRAKTARAKIS G . VAIRAKTARAKIS L . On Gilmore-Gomorys open question for the bottleneck TSP[J]. Operations Research Letters, 2003,31:483-491.
|
| [9] |
KABADI S N . Polynomial solvable cases of the TSP[M]. Traveling Salesman Problem and its Variants, 2007,12:489-583.
|
| [10] |
董学士， 董文永， 蔡永乐 . 混合算法求解着色瓶颈旅行商问题[J]. 计算机研究与发展， 2018,55(11): 2372-2385.
|
|
DONG X S , DONG W Y , CAI Y L . Hybrid algorithm for colored bot-tleneck traveling salesman problem[J]. Journal of Computer Research and Development, 2018,55(11): 2372-2385.
|
| [11] |
CHENG R , JIN Y C . A competitive swarm optimizer for large scale optimization[J]. IEEE Transaction on Cybernetics, 2015,45(2): 191-204.
|
| [12] |
YE B L , WU W M , LI L X , et al. A hierarchical model predictive control approach for signal splits optimization in large-scale urban road networks[J]. IEEE Transaction on Intelligent Transport Systems, 2016,17(8): 2182-2192.
|
| [13] |
OMIDVAR M N , YANG M , MEI Y , et al. DG2: a faster and more accurate differential grouping for large-scale black-box optimization[J]. IEEE Transaction on Evolutionary Computation, 2017,21(6): 929-942.
|
| [14] |
ZHANG X Y , TIAN Y , CHENG R , et al. A decision variable clustering-based evolutionary algorithm for large-scale many-objective optimization[J]. IEEE Transaction on Evolutionary Computation, 2018,22(1): 97-112.
|
| [15] |
HU X M , HE F L , CHEN W N , et al. Cooperation coevolution with fast interdependency identification for large scale optimization[J]. Information Science, 2017,381: 142-160.
|
| [16] |
GAO W F , HUANG L L , LIU S Y , et al. Artificial bee colony algorithm based on information learning[J]. IEEE Transactions on Cybernetics, 2015,45(12): 2827-2838.
|
| [17] |
KARABOGA D . An idea based on honey bee swarm for numerical optimization[R]. Computers Engineering Department, Engineering Faculty, Erciyes University, 2015.
|
| [18] |
LI J Q , PAN Q K , DUAN P Y . An improved artificial bee colony algorithm for solving hybrid flexible flowshop with dynamic operation skipping[J]. IEEE Transactions on Cybernetics, 2016,46(6): 1311-1323.
|
| [19] |
MANUEL L , CARLOS G M , FRANCISCO , , et al. Optimizing network attacks by artificial bee colony[J]. Information Sciences, 2017,377: 30-50.
|
| [20] |
VENKATESH P , SINGH A . Two metaheuristic approaches for the multiple traveling salesperson problem[J]. Applied Soft Computing, 2015,26: 74-89.
|
| [21] |
ZHANG H G , ZHOU J . Dynamic multicale region search algorithm using vitality selection for traveling salesman problem[J]. Expert Systems with Applications, 2016,60: 81-95.
|
),王豫峰
