Next Article in Journal
Pareto Explorer for Finding the Knee for Many Objective Optimization Problems
Next Article in Special Issue
Binary Whale Optimization Algorithm for Dimensionality Reduction
Previous Article in Journal
Unsteady Stagnation Point Flow of Hybrid Nanofluid Past a Convectively Heated Stretching/Shrinking Sheet with Velocity Slip
Previous Article in Special Issue
Success History-Based Adaptive Differential Evolution Using Turning-Based Mutation
Open AccessArticle

Opposition-Based Ant Colony Optimization Algorithm for the Traveling Salesman Problem

by 1,†, 1,†, 1,†, 1 and 2,*
1
School of Electrical Engineering and Automation, Jiangsu Normal University, Xuzhou 221116, China
2
School of Computer Science & School of Physics and Information Technology, Shaanxi Normal University, Xi’an 710119, China
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2020, 8(10), 1650; https://doi.org/10.3390/math8101650
Received: 18 August 2020 / Revised: 22 September 2020 / Accepted: 22 September 2020 / Published: 24 September 2020
(This article belongs to the Special Issue Evolutionary Computation 2020)
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. View Full-Text
Keywords: opposition-based learning; ant colony optimization; opposite path; traveling salesman problems opposition-based learning; ant colony optimization; opposite path; traveling salesman problems
Show Figures

Figure 1

MDPI and ACS Style

Zhang, Z.; Xu, Z.; Luan, S.; Li, X.; Sun, Y. Opposition-Based Ant Colony Optimization Algorithm for the Traveling Salesman Problem. Mathematics 2020, 8, 1650.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Search more from Scilit
 
Search
Back to TopTop