Repositorio de producción científica de la Universidad de Sevilla

A tabu search algorithm for dynamic routing in ATM cell-switching networks

Opened Access A tabu search algorithm for dynamic routing in ATM cell-switching networks

Citas

buscar en

Estadísticas
Icon
Exportar a
Autor: Cortés, Pablo
Muñuzuri Sanz, 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: 2011
Publicado en: Applied soft computing, 11(1), 449-459
Tipo de documento: Artículo
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 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.
Tamaño: 130.0Kb
Formato: PDF

URI: http://hdl.handle.net/11441/40575

DOI: http://dx.doi.org/10.1016/j.asoc.2009.12.004

Mostrar el registro completo del ítem


Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones