Two-stage ant colony optimization for solving the traveling salesman problem

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

Volumn 4528 LNCS, Issue PART 2, 2007, Pages 307-316

  Puris, Amilkar ^a   Bello, Rafael ^a   Martínez, Yailen ^a   Nowe, Ann ^b  

^a CENTRAL UNIVERSITY OF LAS VILLAS   (Cuba)

^b VRIJE UNIVERSITEIT BRUSSEL   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS; PROBLEM SOLVING; SEARCH ENGINES; TRAVELING SALESMAN PROBLEM;

ANT COLONY SYSTEM ALGORITHMS; HEURISTIC SEARCH; TWO-STAGE ANT COLONY OPTIMIZATION;

GLOBAL OPTIMIZATION;

EID: 38149027093     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73055-2_33     Document Type: Conference Paper

References (14)

1. Dorigo, M. et al. The Ant System: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man and Cybernetics-Part B, vol. 26, no. 1, pp. 1-13. 1996.
2. Dorigo, M. and Gambardella, L.M. Ant colonies for the traveling salesman problem. BioSystems no. 43, pp. 73-81, 1997.
3. Dorigo, M. et al. Ant algorithms for Discrete optimization. Artificial Life 5(2), pp. 137-172, 1999.
4. Dorigo, M. and Stützle, T. ACO Algorithms for the Traveling Salesman Problem, 1999, Evolutionary Algorithms in Engineering and Computer Science: Recent Advances in Genetic Algorithms, Evolution Strategies, Evolutionary Programming, Genetic Programming and Industrial Applications, John Wiley & Sons., EEUU.
5. Dorigo, M. and Stutzle, T. Ant Colony Optimization. MIT Press. 2004.
6. Stefanowski, J. An experimental evaluation of improving rule based classifiers with two approaches that change representations of learning examples. Engineering Applications of Artificial Intelligence 17, pp. 439-445. 2004.
7. The TSPLIB Symmetric Traveling Salesman Problem Instances, http://elib.zib.de/pub/Packages/mp-testdata/tsp/tsplib/index.html
8. Walshaw, C. A multilevel approach to the traveling salesman problem. Operations Research 50(5), 862-877, 2002.
9. Bernard, S.T. and Simon, H.D. A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency: Practice and Experience 6 (2), pp. 101-117. 1994.
10. Korosec, P. et al. Solving the mesh-partitioning problem with an ant-colony algorithm. Parallel Computing 30, pp. 785-801. 2004.
11. Michalewicz, Z. and Fogel, D.B. How to solve it: modern heuristics. Springer-Verlag. 2004.
12. Dorigo, M., Maniezzo, V., Colorni, A.: Positive feedback as a search strategy. Technical Report 91-016, Dipartimento di Elettronica, Politecnico di Milano, Milan, Italy (1991).
13. Dorigo, M.: Ottimizzazione, apprendimento automatico, ed algoritmi basati su metafora naturale. PhD thesis, Dipartimento di Elettronica, Politecnico di Milano, Milan, Italy (1992).
14. Walshaw, C. et al. The multilevel paradigm: a generic Meta-heuristic for Combinatorial Optimization Problems?. Technical Report 00/IM/63, Univ. Greenwich, London SE10 9LS, UK. 2000.