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

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

 

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

Show item statistics
Icon
Export to
Author: Cortés, Pablo
Muñuzuri, Jesús
Fernández Valverde, Joaquín Rodrigo
Department: Universidad de Sevilla. Departamento de Organización Industrial y Gestión de Empresas II
Universidad de Sevilla. Departamento de Ingeniería Telemática
Date: 2011
Published in: Applied soft computing, 11(1), 449-459
Document type: Article
Abstract: 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.
Size: 130.0Kb
Format: PDF

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

DOI: 10.1016/j.asoc.2009.12.004

See editor´s version

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)