Search Bias in Constructive Metaheuristics and Implications for Ant Colony Optimisation
Constructive metaheuristics explore a tree of constructive decisions, the topology of which is determined by the way solutions are represented and constructed. Some solution representations allow particular solutions to be reached on a greater number of paths in this construction tree than other solutions, which can introduce a bias to the search. A bias can also be introduced by the topology of the construction tree. This is particularly the case in problems where certain solution representations are infeasible. This paper presents an examination of the mechanisms that determine the topologies of construction trees and the implications for ant colony optimisation. The results provide insights into why certain assignment orders perform better in problems such as the quadratic and generalised assignment problems, in terms of both solution quality and avoiding infeasible solutions.
Unable to display preview. Download preview PDF.
- 1.Beasley, J.E.: OR-library: Distributing test problems by electronic mail. J. Oper. Res. Soc. 41, 1069–1072 (1990)Google Scholar
- 2.Blum, C.: Theoretical and practical aspects of ant colony optimization. PhD dissertation, Université Libre de Bruxelles (2004)Google Scholar
- 3.Blum, C., Sampels, M.: Ant colony optimization for fop shop scheduling: A case study on different pheromone representations. In: Proceedings of CEC 2002, pp. 1558–1563 (2002)Google Scholar
- 5.Blum, C., Sampels, M., Zlochin, M.: On a particularity in model-based search. In: Proceedings of GECCO 2002, New York, pp. 35–42 (2002)Google Scholar
- 8.Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: Optimization by a colony of cooperating agents. IEEE Trans. Sys. Man Cyb. B 26(1), 1–13 (1996)Google Scholar
- 9.Leguizamón, G., Michalewicz, Z.: A new version of ant system for subset problems. In: Proceedings of CEC 1999, pp. 1459–1464 (1999)Google Scholar
- 12.Montgomery, J.: Search bias in constructive metaheuristics and implications for ant colony optimisation. Technical Report TR04-04, Faculty of Information Technology, Bond University, Australia (2004)Google Scholar
- 13.Randall, M.: Heuristics for ant colony optimisation using the generalised assignment problem. In: Proceedings of CEC 2004, Portland, OR, USA (2004)Google Scholar
- 14.Solnon, C.: Ants can solve constraint satisfaction problems. IEEE Trans. Evol. Comput. 6(4) (2001)Google Scholar
- 15.Taillard, É.D., Gambardella, L.M.: Adaptive memories for the quadratic assignment problem. Technical Report IDSIA-87-97, IDSIA (1997)Google Scholar