An external memory implementation in ant colony optimization

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

Volumn 3172 LNCS, Issue , 2004, Pages 73-82

  Acan, Adnan ^a  

^a EASTERN MEDITERRANEAN UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

SWARM INTELLIGENCE; ALGORITHMS; ARTIFICIAL INTELLIGENCE; OPTIMIZATION;

ACO ALGORITHMS; ANT COLONY OPTIMIZATION ALGORITHMS; EXTERNAL MEMORY; KNOWLEDGE INCORPORATION; NUMBER OF ITERATIONS; OBJECTIVE FUNCTION VALUES; PARTICULAR DISTRIBUTION; SOLUTION QUALITY;

ANT COLONY OPTIMIZATION;

EID: 40649100425     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28646-2_7     Document Type: Conference Paper

References (18)

1. Acan, A., Tekol, Y.: Chromosome reuse in genetic algorithms, in Cantu-Paz et al. (eds.): Genetic and Evolutionary Computation Conference GECCO 2003, Springer-Verlag, Chicago, (2003), 695-705.
2. Bonabeau, E., Dorigo, M., Theraluaz, G.: From Natural to Artificial Swarm Intelligence. Oxford University Press, (1999).
3. Cobb, H.G.: An investigation into the use of hypermutation as an adaptive operator in GAs having continuous, time-dependent nonstationary environment. NRL Memorandum Report 6760, (1990).
4. Dorigo, M., Caro, G.D., Gambardella, L.M.: Ant algorithms for distributed discrete optimization, Artificial Life, Vol. 5, (1999), 137-172.
5. Dorigo, M., Caro, G.D.,: The ant colony optimization metaheuristic, In Corne, D., Dorigo, M., Glover, F. (eds.): New ideas in optimzation, McGraw-Hill, London, (1999), 11-32.
6. Eggermont, J., Lenaerts, T.: Non-stationary function optimization using evolutionary algorithms with a case-based memory, Technical report, Leiden University Advanced Computer Sceice (LIACS) Technical Report 2001-11.
7. Goldberg, D. E., Smith, R. E.: Non-stationary function optimization using genetic algorithms and with dominance and diploidy, Genetic Algorithms and their Applications: Proceedings of the Second International Conference on Genetic Algorithms, (1987), 217-223.
8. Guntsch, M., Middendorf, M.: A population based approach for ACO, in S. Cagnoni et al., (eds.): Applications of Evolutionary Computing - EvoWorkshops2002, Lecture Notes in Computer Science, No:2279, Springer Verlag, (2002), 72-81.
9. Guntsch, M., Middendorf, M.: Applying population based ACO for dynamic optimization problems, in M. Dorigo et al., (eds.): Ant Algorithms - Third International Workshop ANTS2002, Lecture Notes in Computer Science, No:2463, Springer Verlag, (2002), 111-122.
10. Lewis, J., Hart, E., Ritchie, G.: A comparison of dominance mechanisms and simple mutation on non-stationary problems, in Eiben, A. E., Back, T., Schoenauer, M., Schwefel, H. (Editors): Parallel Problem Solving from Nature- PPSN V, Berlin, (1998), 139-148.
11. Louis, S., Li, G.: Augmenting genetic algorithms with memory to solve traveling salesman problem, Proceedings of the Joint Conference on Information Sciences, Duke University, (1997), 108-111.
12. Louis, S. J., Johnson, J.: Solving similar problems using genetic algorithms and case-based memory, in Back, T., (Editor):Proceedings of the Seventh International Conference on Genetic Algorithms, San Fransisco, CA, (1997), 84-91.
13. Montgomery, J., Randall, M: The accumulated experience ant colony for the travelling salesman problem, International Journal of Computational Intelligence and Applications, World Scientific Publishing Company, Vol. 3, No. 2, (2003), 189-198.
14. Ramsey, C.L., Grefenstette, J. J.: Case-based initialization of GAs, in Forest, S., (Editor): Proceedings of the Fifth International Conference on Genetic Algorithms, San Mateo, CA, (1993), 84-91.
15. Simoes, A., Costa, E.: Using genetic algorithms to deal with dynamic environments: comparative study of several approaches based on promoting diversity, in W. B. Langton et al. (eds.): Proceedings of the genetic and evolutionary computation conference GECCO'02, Morgan Kaufmann, New York, (2002), 698.
16. Simoes, A., Costa, E.: Using biological inspiration to deal with dynamic environments, Proceedings of the seventh international conference on soft computing MENDEL'2001, Czech Republic, (2001).
17. Stützle, T., Dorigo, M.: ACO Algorithms for the Traveling Salesman Problem. In: Miettinen, K., Neittaanmaki, P., Periaux, J. (eds.): Evolutionary Algorithms in Engineering and Computer Science, John Wiley & Sons, (1999), 163-184.
18. Stützle, T., Dorigo, M.: ACO Algorithms for the Quadratic Assignment Problem. In: Corne, D., Dorigo, M., Glover, F. (eds.): New Ideas in Optimization, McGraw-Hill, (1999), 33-50.