COOBBO: a novel opposition-based soft computing algorithm for TSP problems
Summary: In this paper, we propose a novel definition of opposite path. Its core feature is that the sequence of candidate paths and the distances between adjacent nodes in the tour are considered simultaneously. In a sense, the candidate path and its corresponding opposite path have the same (or similar at least) distance to the optimal path in the current population. Based on an accepted framework for employing opposition-based learning, Oppositional Biogeography-Based Optimization using the Current Optimum, called COOBBO algorithm, is introduced to solve traveling salesman problems. We demonstrate its performance on eight benchmark problems and compare it with other optimization algorithms. Simulation results illustrate that the excellent performance of our proposed algorithm is attributed to the distinct definition of opposite path. In addition, its great strength lies in exploitation for enhancing the solution accuracy, not exploration for improving the population diversity. Finally, by comparing different version of COOBBO, another conclusion is that each successful opposition-based soft computing algorithm needs to adjust and remain a good balance between backward adjacent node and forward adjacent node.
- Coordinating particle swarm optimization, ant colony optimization and K-Opt algorithm for traveling salesman problem
- A discrete artificial bee colony algorithm for TSP
- An improved discrete butterfly optimization algorithm for solving TSP
- Biogeography migration algorithm for traveling salesman problem
- An evolutionary multiobjective optimization method for traveling salesman problems
- A diversity maintaining population-based incremental learning algorithm
- A multi-start opposition-based particle swarm optimization algorithm with adaptive velocity for bound constrained global optimization
- Exploration and exploitation in evolutionary algorithms: a survey
- Oppositional concepts in computational intelligence
- TSPLIB—A Traveling Salesman Problem Library
- Two Frameworks for Improving Gradient-Based Learning Algorithms
This page was built for publication: COOBBO: a novel opposition-based soft computing algorithm for TSP problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736627)
