Xuanyu Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Xuanyu Li has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Shengyang Luan
School of Electrical Engineering and Automation, Jiangsu Normal University, Xuzhou, China
1 shared publication - Yifei Sun
Shaanxi Normal University
1 shared publication - Zhaojun Zhang
School of Electrical Engineering and Automation, Jiangsu Normal University, Xuzhou, China
1 shared publication - Zhaoxiong Xu
School of Electrical Engineering and Automation, Jiangsu Normal University, Xuzhou 221116, China
1 shared publication
Latest Publications
- Open Access
- 24 September 2020
- Published by MDPI AG in Mathematics
- Vol. 8 (10) , 1650
Opposition-Based Ant Colony Optimization Algorithm for the Traveling Salesman Problem
Opposition-based learning (OBL) has been widely used to improve many swarm intelligent optimization (SI) algorithms for continuous problems during the past few decades. When the SI optimization algorithms apply OBL to solve discrete problems, the construction and utilization of the opposite solution is the key issue. Ant colony optimization (ACO) generally used to solve combinatorial optimization problems is a kind of classical SI optimization algorithm. Opposition-based ACO which is combined in OBL is proposed to solve the symmetric traveling salesman problem (TSP) in this paper. Two strategies for constructing opposite path by OBL based on solution characteristics of TSP are also proposed. Then, in order to use information of opposite path to improve the performance of ACO, three different strategies, direction, indirection, and random methods, mentioned for pheromone update rules are discussed individually. According to the construction of the inverse solution and the way of using it in pheromone updating, three kinds of improved ant colony algorithms are proposed. To verify the feasibility and effectiveness of strategies, two kinds of ACO algorithms are employed to solve TSP instances. The results demonstrate that the performance of opposition-based ACO is better than that of ACO without OBL.
- 24 September 2020
- Published by MDPI AG in Mathematics
- Vol. 8 (10) , 1650
Open AccessOpposition-Based Ant Colony Optimization Algorithm for the Traveling Salesman Problem
Opposition-based learning (OBL) has been widely used to improve many swarm intelligent optimization (SI) algorithms for continuous problems during the past few decades. When the SI optimization algorithms apply OBL to solve discrete problems, the construction and utilization of the opposite solution is the key issue. Ant colony optimization (ACO) generally used to solve combinatorial optimization problems is a kind of classical SI optimization algorithm. Opposition-based ACO which is combined in OBL is proposed to solve the symmetric traveling salesman problem (TSP) in this paper. Two strategies for constructing opposite path by OBL based on solution characteristics of TSP are also proposed. Then, in order to use information of opposite path to improve the performance of ACO, three different strategies, direction, indirection, and random methods, mentioned for pheromone update rules are discussed individually. According to the construction of the inverse solution and the way of using it in pheromone updating, three kinds of improved ant colony algorithms are proposed. To verify the feasibility and effectiveness of strategies, two kinds of ACO algorithms are employed to solve TSP instances. The results demonstrate that the performance of opposition-based ACO is better than that of ACO without OBL.