Abstract
In this paper is presented a distributed algorithm based on Ant System concepts,called Combinatorial Ant System, to solve dynamic combinatorial optimization problems. Our approach consists of mapping the solution space of the dynamic combinatorial optimization problem in the space where the ants will walk, and defining the transition probability and the pheromone update formula of the Ant System according to the objective function of the optimization problem. We test our approach on a telecommunication problem.
References
Bonabeau, E.; Dorigo, M.; Theraulaz, G. (1999) Swarm Intelligence: from Natural to Artificial Swarm Systems. Oxford University Press, USA.
Dorigo, M. (1992) Optimization, Learning and Natural Algorithms. Ph.D Thesis, Politecnico de Milano, Italy.
Corne, D.; Dorigo, M.; Glover, F. (1999) New Ideas in Optimization. McGraw Hill, Holland.
Dorigo, M.; Maniezzo, V.; Coloni, A. (1996) “The ant system: optimization by a colony of cooperating agents”, IEEE Trans. Syst. Man, Cybern. 26: 29–41.
Dorigo, M.; Gambardella, L. (1997) “Ant colony system: a cooperative learning approach to the traveling salesman problem”, IEEE Trans. on Evolutionary Computation 1: 53–66.
Hidrobo, F.; Aguilar, J. (1998) “Toward a parallel genetic algorithm approach based on collective intelligence for combinatorial optimization problems”, In: Proc. IEEE International Conference on Evolutionary Computation: 715–720.
Schoonderwoerd, R.; Holland, O.; Bruten, J.; Rothkrantz, L. (1997) “Ant-based load balancing in telecommunications networks”, Adaptive Behavior 5: 169–207.
Aguilar, J.; Velásquez, L.; Pool, M. (2004) “The combinatorial ant system”, Applied Artificial Intelligence Journal 18(5): 427–446.
Aguilar, J. (2003) “A set of experiments for the combinatorial ant system”, Technical Report, CEMISID 12-2003.