Artículo
A tabu search algorithm for dynamic routing in ATM cell-switching networks
Autor/es | Cortés, Pablo
Muñuzuri, Jesús Fernández Valverde, Joaquín Rodrigo |
Departamento | Universidad de Sevilla. Departamento de Organización Industrial y Gestión de Empresas II Universidad de Sevilla. Departamento de Ingeniería Telemática |
Fecha de publicación | 2011 |
Fecha de depósito | 2016-04-28 |
Publicado en |
|
Resumen | This paper deals with the dynamic routing problem in ATM cell-switching networks. We present a
mathematical programming model based on cell loss and a Tabu Search algorithm with short-term
memory that is reinforced with ... This paper deals with the dynamic routing problem in ATM cell-switching networks. We present a mathematical programming model based on cell loss and a Tabu Search algorithm with short-term memory that is reinforced with a long-term memory procedure. The estimation of the quality of the solutions is fast, due to the specific encoding of the feasible solutions. The Tabu Search algorithm reaches good quality solutions, outperforming other approaches such as Genetic Algorithms and the Minimum Switching Path heuristic, regarding both cell loss and the CPU time consumption. The best results were found for the more complex networks with a high number of switches and links. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
A tabu search algorithm for ... | 130.0Kb | [PDF] | Ver/ | |