The Combinatorial ANT System for Dynamic Combinatorial Optimization Problems

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 wil...

Full description

Main Author: Aguilar, Jose
Format: Artículo
Language: Español
Published: 2015
Online Access: http://revistas.ucr.ac.cr/index.php/matematica/article/view/250
http://hdl.handle.net/10669/12896
Summary: 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.