A tabu search algorithm for the routing and capacity assignment problem in computer networks

A tabu search metaheuristic algorithm for a classical routing and capacity assignment (CFA) problem in computer networks is presented in this paper. Computational experiments across a variety of networks are reported. The results show that the proposed tabu search algorithm is both effective and eff...

Full description

Saved in:
Bibliographic Details
Published in:Computers & operations research 2005-11, Vol.32 (11), p.2785-2800
Main Authors: Shen, Jian, Xu, Fuyong, Zheng, Peng
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Combinatorial optimization
Computer networks
Exact sciences and technology
Flows in networks. Combinatorial problems
Operational research and scientific management
Operational research. Management science
Operations research
Optimization
Optimization techniques
Routing
Routing and capacity assignment
Searches
Studies
Tabu search
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A tabu search metaheuristic algorithm for a classical routing and capacity assignment (CFA) problem in computer networks is presented in this paper. Computational experiments across a variety of networks are reported. The results show that the proposed tabu search algorithm is both effective and efficient in finding good solutions of the CFA problem compared with the traditional Lagrangean relaxation and subgradient optimization technique. Extensive tests are made in order to choose the best values of the parameters for tabu search algorithm.
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2004.04.004