Robust and efficient ant colony algorithm; Using new local updating rule

ICSPC 2007 Proceedings - 2007 IEEE International Conference on Signal Processing and Communications

Volumn , Issue , 2007, Pages 161-164

  Taherinejad, Nima ^a   Naimi, Hossein Miar ^a  

^a BABOL NOSHIRVANI UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

Ant colony algorithm; Heuristic algorithms; Local updating; Optimizing

Indexed keywords

ANT COLONY ALGORITHM; LOCAL UPDATING; OPTIMIZING; RANDOM PROBLEMS; STANDARD PROBLEMS;

ALGORITHMS; GLOBAL OPTIMIZATION; HEURISTIC METHODS; PORTALS; SIGNAL PROCESSING;

HEURISTIC ALGORITHMS;

EID: 60349101908     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSPC.2007.4728280     Document Type: Conference Paper

References (19)

1. http://elib. zib.de/pub/Packadges/mp-testdata/tsp/tsplib/tsplib.html
2. Nagata Y. & S. Kobayashi. (1997). Edge Assembly Crossover: A High-power Genetic Algorithm for the Traveling Salesman Problem. Proceedrngs of Seventh International Conference on Genetic Algorithms (ICGA'97), East Lansing Michigan, pp. 450-457.
3. Glover F. and Laguna, M. (1997) Tabu Search" Boston Kluwer Academic Publishers
4. C. Blum, "Ant Colon) Optimization Introduction and recent advaces", Fifth International conference on Hydrabad Intelligent Systms (HIS'05), Rio de Taneiro - Brazil, November 6-9, 2005.
5. An Introduction to Ant Algonthms and to Ant Colony Optimization ANTS'2000 - From Ant Colonies to Artificial Ants: Second International Workshop on Ant Algorithms, BrusseK Belgium September 7, 2000.
6. R. Beckers J L Deneubourg and S Goss "Trails and U-turns in the selection of the shortestpath by the ant Lasius Niger", Journal of Theoretical Biology, vol 159 pp 397-415
7. S. Goss S. Aron J.L. Deneubourg and J.M. Pasteels, "Self-organized shortcuts in the argentine ant," Naturwissenschaften, vol. 76, pp. 579-581, 1989.
8. B. Holldobler and E. O Wilson, The Ants, Springer - Verlag, Berlin, 1990
9. Beckers, Deneubourg and Goss, 1992; Goss, Aron, Deneubourg and Pasteels, 1989
10. Deneubourg, Aron, Goss, & Pasteels, 1990, Goss et al 1989
11. E.L.Lawler, J. KLenstra, A.H.G.Rinnooy Kan and D.B.Shmoys, editors. The Traveling Salesman Problem. Wiley, 1985
12. Alberto Colorni, Marco Dorigo, Vittorio Maniezzo, al. "An investigation of some properties of Ant Algorithm", Brussels, Belgium, PPSN 1992, Elsevier Publishing, 509-520
13. Alberto Colorni, Marco Dorigo, Vittorio Maniezzo, al, "The ant system optimization by a colony of cooperating agent" IEEE 1996
14. Marco Dorigo, Luca Maria Gambardella, al "Ant Colonies for Travelling Salesman Problem", TR/IRIDIA/1993-6, Universite' Libre de Bruxelles, Belgium
15. Marco Dorigo, Luca Maria Gambardella, "A STUDY OF SOME PROPERTIES OF ANT-Q", TR/IRIDIA/1996-4 Universite Libre de Bruxelle, Belgium, published in PPSN IV-Fourth International Conference
16. Reinelt, G., 1994, The traveling salesman: Computational solutions for TSP applications (Springer-Verlag, Berlin). Johnson, D.S. and McGeoch, L.A., in press. The Travelling Salesman Problem: A Case Study in Local Optimization, in: Local Search in Combinatorial Optimization, E.H.L. Aarts and J.K. Lenstra (eds.) (Wiley, New York).
17. Simon Kaegi, Tony White, "Using Local Information To Guide Ant Based Search", School of Computer Science, Carleton University, Ottawa, Ontario, Canada, 2003
18. Vittorio Maniezzo, Luca Maria Gambardella, FabioDe Luigi, al, "Ant. Colony Optimization", Aco 2004
19. Meibodi. M. Noferesty. S. "A combinational algorithm (Ant colony + Learning Automata) to resolve Steiner Static Tree Problem", ICEE 2006