An External Memory Implementation in Ant Colony Optimization
An ant colony optimization algorithm using a library of partial solutions for knowledge incorporation from previous iterations is introduced. Initially, classical ant colony optimization algorithm runs for a small number of iterations and the library of partial solutions is initialized. In this library, variable size solution segments from a number of elite solutions are stored and each segment is associated with its parent’s objective function value. There is no particular distribution of ants in the problem space and the starting point for an ant is the initial point of the segment it starts with. In order to construct a solution, a particular ant retrieves a segment from the library based on its goodness and completes the rest of the solution. Constructed solutions are also used to update the memory. The proposed approach is used for the solution of TSP and QAP for which the obtained results demonstrate that both the speed and solution quality are improved compared to conventional ACO algorithms.
KeywordsGenetic Algorithm Problem Instance Travel Salesman Problem Travel Salesman Problem External Memory
Unable to display preview. Download preview PDF.
- 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) Google Scholar
- 5.Dorigo, M., Caro, G.D.: The ant colony optimization metaheuristic. In: Corne, D., Dorigo, M., Glover, F. (eds.) New ideas in optimzation, pp. 11–32. McGraw-Hill, London (1999)Google Scholar
- 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-2011Google Scholar
- 7.Goldberg, D.E., Smith, R.E.: Non-stationary function optimization using genetic algorithms and with dominance and diploidy, Genetic Algorithms and their Applications. In: Proceedings of the Second International Conference on Genetic Algorithms, pp. 217–223 (1987)Google Scholar
- 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. (eds.) Parallel Problem Solving from Nature- PPSN V, Berlin, pp. 139–148 (1998)Google Scholar
- 11.Louis, S., Li, G.: Augmenting genetic algorithms with memory to solve traveling salesman problem. In: Proceedings of the Joint Conference on Information Sciences, Duke University, pp. 108–111 (1997)Google Scholar
- 12.Louis, S.J., Johnson, J.: Solving similar problems using genetic algorithms and case-based memory. In: Back, T. (ed.) Proceedings of the Seventh International Conference on Genetic Algorithms, San Fransisco, CA, pp. 84–91 (1997)Google Scholar
- 14.Ramsey, C.L., Grefenstette, J.J.: Case-based initialization of GAs. In: Forest, S. (ed.) Proceedings of the Fifth International Conference on Genetic Algorithms, San Mateo, CA, pp. 84–91 (1993)Google Scholar
- 15.Simoes, A., Costa, E.: Using genetic algorithms to deal with dynamic environments: comparative study of several approaches based on promoting diversity. In: Langton, W.B., et al. (eds.) Proceedings of the genetic and evolutionary computation conference GECCO 2002, p. 698. Morgan Kaufmann, New York (2002)Google Scholar
- 16.Simoes, A., Costa, E.: Using biological inspiration to deal with dynamic environments. In: Proceedings of the seventh international conference on soft computing MENDEL 2001, Czech Republic (2001)Google Scholar
- 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, pp. 163–184. John Wiley & Sons, Chichester (1999)Google Scholar
- 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, pp. 33–50. McGraw-Hill, New York (1999)Google Scholar