Candidate set strategies for ant colony optimisation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2463, Issue , 2002, Pages 243-249

  Randall, Marcus ^a   Montgomery, James ^a  

^a BOND UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CANDIDATE SETS; CAR SEQUENCING PROBLEM; COMPUTATIONAL TIME; SOLUTION ELEMENT; TEST PROBLEM; TRAVELLING SALESMAN;

ANT COLONY OPTIMIZATION;

EID: 84974707321     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45724-0_22     Document Type: Conference Paper

References (10)

1. 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.
2. Dorigo, M., Gambardella, L.M.: Ant Colonies for the Traveling Salesman Problem. BioSystems 43 (1997) 73-81.
3. 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).
4. Reinelt, G.: The Traveling Salesman: Computational Solutions for TSP Applications. Springer-Verlag, Berlin (1994).
5. 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).
6. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997).
7. 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).
8. Smith, K., Palaniswami, M., Krishnamoorthy, M.: A Hybrid Neural Network Approach to Combinatorial Optimisation. Computers and Operations Research 73 (1996) 501-508.
9. Randall, M., Montgomery, J.: Candidate Set Strategies for Ant Colony Optimisation. School of Information Technology, Bond University, Australia, Technical Report TR02-04 (2002).
10. Feo, T.A., Resende, M.G.C.: Greedy Randomized Adaptive Search Procedures. Journal of Global Optimization 6 (1995) 109-133.