- Authors:
- L. M. Gambardella,
- M. Dorigo
We present HAS-SOP, a new approach to solving sequential ordering problems. HAS-SOP combines the ant colony algorithm, a population-based metaheuristic, with a new local optimizer, an extension of a TSP heuristic which directly handles multiple constraints without increasing computational complexity. We compare different implementations of HAS-SOP and present a new data structure that improves system performance. Experimental results on a set of twenty-three test problems taken from the TSPLIB show that HAS-SOP outperforms existing methods both in terms of solution quality and computation time. Moreover, HAS-SOP improves most of the best known results for the considered problems.
Cited By
- Boryczka U and Kozak J (2015). Enhancing the effectiveness of Ant Colony Decision Tree algorithms by co-learning, Applied Soft Computing, 30:C, (166-178), Online publication date: 1-May-2015.
- Kozak J and Boryczka U (2019). Multiple Boosting in the Ant Colony Decision Forest meta-classifier, Knowledge-Based Systems, 75:C, (141-151), Online publication date: 1-Feb-2015.
- Kim K, Ha C and Ok C (2018). Network structure-aware ant-based routing in large-scale wireless sensor networks, International Journal of Distributed Sensor Networks, 2015, (182-182), Online publication date: 1-Jan-2015.
- Changdar C, Mahapatra G and Pal R (2013). An Ant colony optimization approach for binary knapsack problem under fuzziness, Applied Mathematics and Computation, 223, (243-253), Online publication date: 1-Oct-2013.
- Sharma V, Agarwal M and Sen K (2019). Reliability evaluation and optimal design in heterogeneous multi-state series-parallel systems, Information Sciences: an International Journal, 181:2, (362-378), Online publication date: 1-Jan-2011.
- Yang J and Zhuang Y (2010). An improved ant colony optimization algorithm for solving a complex combinatorial optimization problem, Applied Soft Computing, 10:2, (653-660), Online publication date: 1-Mar-2010.
- Maniezzo V and Roffilli M (2008). VERY STRONGLY CONSTRAINED PROBLEMS, Cybernetics and Systems, 39:4, (395-424), Online publication date: 1-May-2008.
- Ho C and Ewe H Ant Colony Optimization Approaches for the Dynamic Load-Balanced Clustering Problem in Ad Hoc Networks Proceedings of the 2007 IEEE Swarm Intelligence Symposium, (76-83)
- Randall M Competitive ant colony optimisation Proceedings of the 20th international conference on Industrial, engineering, and other applications of applied intelligent systems, (974-983)
- Felner A, Shoshani Y, Altshuler Y and Bruckstein A (2018). Multi-agent Physical A* with Large Pheromones, Autonomous Agents and Multi-Agent Systems, 12:1, (3-34), Online publication date: 1-Jan-2006.
- Chu D, Till M and Zomaya A Parallel Ant Colony Optimization for 3D Protein Structure Prediction using the HP Lattice Model Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 6 - Volume 07
- Chen L, Tu L and Chen Y An ant clustering method for a dynamic database Proceedings of the 4th international conference on Advances in Machine Learning and Cybernetics, (169-178)
- Ho C and Ewe H Performance of an ant colony optimization (ACO) algorithm on the dynamic load-balanced clustering problem in ad hoc networks Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I, (622-629)
- Ying K and Liao C (2019). An ant colony system for permutation flow-shop sequencing, Computers and Operations Research, 31:5, (791-801), Online publication date: 20-Apr-2004.
- Boryczka U and Boryczka M Multi-cast ant colony system for the bus routing problem Metaheuristics, (91-125)
- Wade A and Salhi S An ant system algorithm for the mixed vehicle routing problem with backhauls Metaheuristics, (699-719)
- Chen L, Shen J, Qin L and Fan J A method for solving optimization problem in continuous space using improved ant colony algorithm Proceedings of the 2004 Chinese academy of sciences conference on Data Mining and Knowledge Management, (61-70)
Sauter J, Matthews R, Van Dyke Parunak H and Brueckner S Evolving adaptive pheromone path planning mechanisms Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1, (434-440)- Câmara D and Loureiro A (2018). GPS/Ant-Like Routing in Ad Hoc Networks, Telecommunications Systems, 18:1-3, (85-100), Online publication date: 1-Sep-2001.
- Ascheuer N, Jünger M and Reinelt G (2019). A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints, Computational Optimization and Applications, 17:1, (61-84), Online publication date: 1-Oct-2000.
- Van Dyke Parunak H and Brueckner S Ant-like missionaries and cannibals Proceedings of the fourth international conference on Autonomous agents, (467-474)
- Dorigo M, Di Caro G and Gambardella L (1999). Ant algorithms for discrete optimization, Artificial Life, 5:2, (137-172), Online publication date: 1-Apr-1999.
Recommendations
An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
<P>We present a new local optimizer called SOP-3-exchange for the sequential ordering problem that extends a local search for the traveling salesman problem to handle multiple constraints directly without increasing computational complexity. An ...
Ant Colony System with Selective Pheromone Memory for SOP
ICCCI 2013: Proceedings of the 5th International Conference on Computational Collective Intelligence. Technologies and Applications - Volume 8083Ant Colony System (ACS) is a well known metaheuristic algorithm for solving difficult optimization problems inspired by the foraging behaviour of social insects (ants). Artificial ants in the ACS cooperate indirectly through deposition of pheromone ...
A new hybrid method based on Particle Swarm Optimization, Ant Colony Optimization and 3-Opt algorithms for Traveling Salesman Problem
The Traveling Salesman Problem (TSP) is one of the standard test problems used in performance analysis of discrete optimization algorithms. The Ant Colony Optimization (ACO) algorithm appears among heuristic algorithms used for solving discrete ...