The Combinatorial ANT System for Dynamic Combinatorial Optimization Problems
Guardado en:
| Údar: | |
|---|---|
| Formáid: | artículo original |
| Stádas: | Versión publicada |
| Fecha de Publicación: | 2005 |
| Cur Síos: | 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. |
| País: | Portal de Revistas UCR |
| Institiúid: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| Teanga: | Español |
| OAI Identifier: | oai:archivo.portal.ucr.ac.cr:article/250 |
| Rochtain Ar Líne: | https://archivo.revistas.ucr.ac.cr/index.php/matematica/article/view/250 |
| Palabra clave: | Dynamic Combinatorial Optimization Problems Swarm Intelligence Intelligent Heuristic Search Distributed Intelligent Processing Routing Algorithms Problemas de Optimización Combinatoria Dinámicos Inteligencia Colectiva Búsqueda Heurística Inteligente Procesamiento Inteligente Distribuido Algoritmos de Enrutamiento |