New robust and efficient ant colony algorithms: Using new interpretation of local updating process

Expert Systems with Applications

Volumn 36, Issue 1, 2009, Pages 481-488

  Naimi, Hossein Miar ^a   Taherinejad, Nima ^a  

^a UNIVERSITY OF MAZANDARAN   (Iran)

Author keywords

Ant colony algorithm; Heuristic algorithms; Local updating; Optimizing

Indexed keywords

GLOBAL OPTIMIZATION; SOLUTIONS;

ANT COLONY ALGORITHM; HEURISTIC ALGORITHMS; LOCAL UPDATING; OPTIMIZING;

ALGORITHMS;

EID: 53849105454     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2007.09.048     Document Type: Article

References (18)

1. An introduction to ant algorithms and to ant colony optimization (2000). In ANTS'2000 - From ant colonies to artificial ants: Second international workshop on ant algorithms, Brussels, Belgium, September 7, 2000.
2. Beckers R., Aron S., Deneubourg J.L., and Pasteels J.M. Memory and chemical communication in the orientation of two mass-recruiting ant species. Insectes Sociaux 40 (1993) 369-380
3. Beckers R., Deneubourg J.L., and Goss S. Trails and U-turns in the selection of the shortestpath by the ant Lasius Niger. Journal of Theoretical Biology 159 (1992) 397-415
4. Blum, C. (2005). Ant colony optimization: Introduction and recent advances. In Fifth international conference on hybrid intelligent systems (HIS'05), Rio de Janeiro - Brazil, 6-9 November.
5. Colorni A., Dorigo M., Maniezzo V., et al. An investigation of some properties of ant algorithm (1992), Elsevier Publishing, Brussels, Belgium (pp. 509-520), PPSN
6. Colorni, A., Dorigo, M., Maniezzo, V., et al. (1996). The ant system optimization by a colony of cooperating agent, IEEE.
7. Dorigo, M., Gambardella, L. M., et al. Ant colonies for travelling salesman problem, TR/IRIDIA/1993-6, Universite' Libre de Bruxelles, Belgium.
8. Dorigo, M., Gambardella, L. M. A study of some properties of ant-q, TR/IRIDIA/1996-4 Université Libre de Bruxelle,Belgium, published in PPSN IV-fourth international conference.
9. Glover F., and Laguna M. Tabu search (1997), Kluwer Academic Publishers, Boston
10. Goss S., Aron S., Deneubourg J.L., and Pasteels J.M. Self-organized shortcuts in the argentine ant. Naturwissenschaften 76 (1989) 579-581
11. Holldobler B., and Wilson E.O. The Ants (1990), Springer-Verlag, Berlin
12. 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, & J. K. Lenstra (Eds.), Wiley, New York.
13. Kaegi S., and White T. Using local information to guide ant based search, school of computer science (2003), Carleton University, Ottawa, Ontario, Canada
14. In: Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., and Shmoys D.B. (Eds). The traveling salesman problem (1985), Wiley
15. Maniezzo, V., Gambardella, L. M., F., De Luigi, et al. (2004). Ant colony optimization, Aco 2004.
16. Meibodi, M., Noferesty, S., (2006). A combinational algorithm (Ant colony + Learning automata) to resolve steiner static tree problem. In ICEE 2006.
17. Nagata, Y., & Kobayashi, S. (1997). Edge assembly crossover: A high-power genetic algorithm for the traveling salesman problem. In Proceedings of seventh international conference on genetic algorithms (ICGA'97), East Lansing, Michigan (pp. 450-457).
18. Reinelt G. The traveling salesman: Computational solutions for TSP applications (1994), Springer-Verlag, Berlin