Deception in Ant Colony Optimization
The search process of a metaheuristic is sometimes misled. This may be caused by features of the tackled problem instance, by features of the algorithm, or by the chosen solution representation. In the field of evolutionary computation, the first case is called deception and the second case is referred to as bias. In this work we formalize the notions of deception and bias for ant colony optimization. We formally define first order deception in ant colony optimization, which corresponds to deception as being described in evolutionary computation. Furthermore, we formally define second order deception in ant colony optimization, which corresponds to the bias introduced by components of the algorithm in evolutionary computation. We show by means of an example that second order deception is a potential problem in ant colony optimization algorithms.
Unable to display preview. Download preview PDF.
- 1.Blum, C.: Theoretical and practical aspects of ant colony optimization. PhD thesis, IRIDIA, Université Libre de Bruxelles, Belgium (2004)Google Scholar
- 5.Blum, C., Sampels, M., Zlochin, M.: On a particularity in model-based search. In: Langdon, W.B., et al. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002), pp. 35–42. Morgan Kaufmann Publishers, San Francisco (2002)Google Scholar
- 7.Deb, K., Goldberg, D.E.: Analyzing deception in trap functions. In: Whitley, L.D. (ed.) Foundations of Genetic Algorithms, vol. 2, pp. 93–108. Morgan Kaufmann, San Mateo (1993)Google Scholar
- 8.Dorigo, M.: Optimization, Learning and Natural Algorithms (in Italian). PhD thesis, Dip. di Elettronica, Politecnico di Milano, Italy (1992)Google Scholar
- 9.Dorigo, M., Maniezzo, V., Colorni, A.: Positive feedback as a search strategy. Technical Report 91-016, Dip. di Elettronica, Politecnico di Milano, Italy (1991)Google Scholar
- 12.Goldberg, D.E.: Simple genetic algorithms and the minimal deceptive problem. In: Davis, L. (ed.) Genetic algorithms and simulated annealing, Pitman, London, UK, pp. 74–88 (1987)Google Scholar
- 16.Rothlauf, F., Goldberg, D.E.: Prüfer numbers and genetic algorithms: A lesson on how the low locality of an encoding can harm the performance of GAs. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 395–404. Springer, Heidelberg (2000)CrossRefGoogle Scholar