A dual population parallel ant colony optimization algorithm for solving the traveling salesman problem

2012 ◽  
Vol 7 (5) ◽  
pp. 66-74 ◽  
Author(s):  
Fang Liu
Keyword(s):  
Ant Colony Optimization ◽  
Traveling Salesman Problem ◽  
Optimization Algorithm ◽  
Traveling Salesman ◽  
Ant Colony ◽  
Ant Colony Optimization Algorithm ◽  
The Traveling Salesman Problem

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

Mathematics ◽  
2020 ◽  
Vol 8 (10) ◽  
pp. 1650
Author(s):  
Zhaojun Zhang ◽  
Zhaoxiong Xu ◽  
Shengyang Luan ◽  
Xuanyu Li ◽  
Yifei Sun
Keyword(s):  
Ant Colony Optimization ◽  
Traveling Salesman Problem ◽  
Optimization Algorithm ◽  
Optimization Problems ◽  
Traveling Salesman ◽  
Ant Colony ◽  
Ant Colony Optimization Algorithm ◽  
Combinatorial Optimization Problems ◽  
Opposition Based Learning ◽  
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.

scholarly journals Use of Ant Colony Optimization Algorithm for Determining Traveling Salesman Problem Routes

2019 ◽  
Vol 5 (2) ◽  
pp. 100-111
Author(s):  
Bib Paruhum Silalahi ◽  
Nurul Fathiah ◽  
Prapto Tri Supriyo
Keyword(s):  
Ant Colony Optimization ◽  
Traveling Salesman Problem ◽  
Optimization Algorithm ◽  
Execution Time ◽  
Traveling Salesman ◽  
Ant Colony ◽  
Food Sources ◽  
Ant Colony Optimization Algorithm ◽  
Initial Node ◽  
The Traveling Salesman Problem

Ant Colony Optimization is one of the meta-heuristic methods used to solve combinatorial optimization problems that are quite difficult. Ant Colony Optimization algorithm is inspired by ant behavior in the real world to build the shortest path between food sources and their nests. Traveling Salesman Problem is a problem in optimization. Traveling Salesman Problem is a problem to find the minimum distance from the initial node to the whole node with each node must be visited exactly once and must return to the initial node. Traveling Salesman Problem is a non-deterministic polynomial-time complete problem. This research discusses the solution of the Traveling Salesman Problem using the Ant Colony Optimization algorithm and also using the exact algorithm. The results showed that the greater the size of the Traveling Salesman Problem case, the longer the execution time required. The results also showed that the execution times of the Ant Colony Optimization are much faster than the execution time of the exact method.

Sign in / Sign up

Export Citation Format

Share Document