2011
DOI: 10.1016/j.asoc.2009.12.004
|View full text |Cite
|
Sign up to set email alerts
|

A Tabu Search algorithm for dynamic routing in ATM cell-switching networks

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 heuris… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 15 publications
0
1
0
Order By: Relevance
“…Tosun [19], applied genetic algorithm (GA), ant colony optimization (ACO) [20] and Tabu-search method [21] to solve data allocation problem. The comparison results exhibited the robustness of suggested methods using QAPLIB benchmark library.…”
Section: State-of-the-art In Methods For Solving Data Allocation Probmentioning
confidence: 99%
“…Tosun [19], applied genetic algorithm (GA), ant colony optimization (ACO) [20] and Tabu-search method [21] to solve data allocation problem. The comparison results exhibited the robustness of suggested methods using QAPLIB benchmark library.…”
Section: State-of-the-art In Methods For Solving Data Allocation Probmentioning
confidence: 99%