A tabu search algorithm for the routing and capacity assignment problem in computer networks [An article from: Computers and Operations Research]

This digital document is a journal article from Computers and Operations Research, published by Elsevier in . The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.

Description:
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.