Tabu Search-based algorithm for Capacitated Multicommodity Network Design Problem

Authors:
Nadia Cobos Zaleta;Ada M. Alvarez Socarrás
Affiliations:
-;-
Venue:
CONIELECOMP '04 Proceedings of the 14th International Conference on Electronics, Communications and Computers
Year:
2004

Citing 0
Cited 2

A heuristic to find a p%-robust network design

ISTASC'04 Proceedings of the 4th WSEAS International Conference on Systems Theory and Scientific Computation
A capacity scaling heuristic for the multicommodity capacitated network design problem

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The goal of this paper is to present an efficientprocedure to find good solutions to realistically sizefixed-charge, capacitated, multicommodity, networkdesign problems. At the present time, there exists noalgorithm that can solve large instances, common inseveral applications, in a reasonable period of time, soheuristic procedures must be applied. The designproblem addressed in this work is formulated as amixed-integer programming problem and solved by aprocedure based in Tabu Search meta-heuristic.Computational experiments were conducted andresults are compared with those obtained by anevolutionary algorithm.