Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
474935 | Computers & Operations Research | 2005 | 16 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Jian Shen, Fuyong Xu, Peng Zheng,