Ant algorithms for discrete optimization
Artificial Life
A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints
Computational Optimization and Applications
Evolving adaptive pheromone path planning mechanisms
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Ant Algorithms Solve Difficult Optimization Problems
ECAL '01 Proceedings of the 6th European Conference on Advances in Artificial Life
A Comparative Study of ANT-Based Optimization for Dynamic Routing
AMT '01 Proceedings of the 6th International Computer Science Conference on Active Media Technology
An ant colony system for permutation flow-shop sequencing
Computers and Operations Research
Multi-cast ant colony system for the bus routing problem
Metaheuristics
A new hybrid heuristic approach for solving large traveling salesman problem
Information Sciences—Informatics and Computer Science: An International Journal
Parallel Ant Colony Optimization for 3D Protein Structure Prediction using the HP Lattice Model
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 6 - Volume 07
Parallelization Strategies for Rollout Algorithms
Computational Optimization and Applications
Multi-agent Physical A* with Large Pheromones
Autonomous Agents and Multi-Agent Systems
The influence of trail representation in ACO for good results in MKP
ACST'06 Proceedings of the 2nd IASTED international conference on Advances in computer science and technology
A hybrid approach for feature subset selection using neural networks and ant colony optimization
Expert Systems with Applications: An International Journal
Iterated fast local search algorithm for solving quadratic assignment problems
Robotics and Computer-Integrated Manufacturing
VERY STRONGLY CONSTRAINED PROBLEMS: AN ANT COLONY OPTIMIZATION APPROACH
Cybernetics and Systems
An Ant Algorithm for the Steiner Tree Problem in Graphs
Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing
Prediction of MHC class II binders using the ant colony search strategy
Artificial Intelligence in Medicine
Competitive ant colony optimisation
IEA/AIE'07 Proceedings of the 20th international conference on Industrial, engineering, and other applications of applied intelligent systems
Reliability evaluation and optimal design in heterogeneous multi-state series-parallel systems
Information Sciences: an International Journal
A novel ant clustering algorithm with digraph
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part II
Adaptive parallel ant colony algorithm
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part II
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
An ant clustering method for a dynamic database
ICMLC'05 Proceedings of the 4th international conference on Advances in Machine Learning and Cybernetics
A method for solving optimization problem in continuous space using improved ant colony algorithm
CASDMKM'04 Proceedings of the 2004 Chinese academy of sciences conference on Data Mining and Knowledge Management
| Hi-index | 0.00 |
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.