Abstract
Ant Colony Optimisation based solvers systematically scan the set of possible solution elements before choosing a particular one. Hence, the computational time required for each step of the algorithm can be large. One way to overcome this is to limit the number of element choices to a sensible subset, or candidate set. This paper describes some novel generic candidate set strategies and tests these on the travelling salesman and car sequencing problems. The results show that the use of candidate sets helps to find competitive solutions to the test problems in a relatively short amount of time.
This author is a PhD scholar supported by an Australian Postgraduate Award.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dorigo, M., Di Caro, G.: The Ant Colony Optimization Meta-heuristic. In Corne, D., Dorigo, M., Glover, F. (eds.): New Ideas in Optimization. McGraw-Hill, London (1999) 11–32
Dorigo, M., Gambardella, L.M.: Ant Colonies for the Traveling Salesman Problem. BioSystems 43 (1997) 73–81
Stützle, T., Dorigo, M.: ACOAlgorithms for the Traveling Salesman Problem. In Miettinen, K., Makela, M., Neittaanmaki, P., Periaux, J. (eds.): Evolutionary Algorithms in Engineering and Computer Science. Wiley (1999)
Reinelt, G.: The Traveling Salesman: Computational Solutions for TSP Applications. Springer-Verlag, Berlin (1994)
Bullnheimer, B., Hartl, R.F., Strauß, C.: An Improved Ant System Algorithm for the Vehicle Routing Problem. Sixth Viennese workshop on Optimal Control, Dynamic Games, Nonlinear Dynamics and Adaptive Systems, Vienna, Austria (1997)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)
Stützle, T., Hoos, H.: Improving the Ant System: A Detailed Report on the MAXMIN Ant System. Darmstadt University of Technology, Computer Science Department, Intellectics Group., Technical Report AIDA-96-12-Revised version (1996)
Smith, K., Palaniswami, M., Krishnamoorthy, M.: A Hybrid Neural Network Approach to Combinatorial Optimisation. Computers and Operations Research 73 (1996) 501–508
Randall, M., Montgomery, J.: Candidate Set Strategies for Ant Colony Optimisation. School of Information Technology, Bond University, Australia, Technical Report TR02-04 (2002)
Feo, T.A., Resende, M.G.C.: Greedy Randomized Adaptive Search Procedures. Journal of Global Optimization 6 (1995) 109–133
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Randall, M., Montgomery, J. (2002). Candidate Set Strategies for Ant Colony Optimisation. In: Dorigo, M., Di Caro, G., Sampels, M. (eds) Ant Algorithms. ANTS 2002. Lecture Notes in Computer Science, vol 2463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45724-0_22
Download citation
DOI: https://doi.org/10.1007/3-540-45724-0_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44146-5
Online ISBN: 978-3-540-45724-4
eBook Packages: Springer Book Archive