A heuristic to find a p%-robust network design

Authors:
Ada M. Alvarez;Agusto Medina;Karim De Alba
Affiliations:
Facultad de Ingeniería Mecánica y Eléctrica, Universidad Autónoma de Nuevo León, Monterrey, NL, México;Facultad de Ingeniería Mecánica y Eléctrica, Universidad Autónoma de Nuevo León, Monterrey, NL, México;Facultad de Ingeniería Mecánica y Eléctrica, Universidad Autónoma de Nuevo León, Monterrey, NL, México
Venue:
ISTASC'04 Proceedings of the 4th WSEAS International Conference on Systems Theory and Scientific Computation
Year:
2004

Citing 4
Cited 0

Applying robust optimization to capacity expansion of one location in telecommunications with demand uncertainty

Management Science
Tabu Search

Tabu Search
Tabu Search-based algorithm for Capacitated Multicommodity Network Design Problem

CONIELECOMP '04 Proceedings of the 14th International Conference on Electronics, Communications and Computers
A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a network with a set of nodes and a set of potential edges, we must decide what edges will be included in the design to satisfy demands between pairs of nodes. Each edge has associated a finite capacity, a fixed cost and routing costs. Uncertainty will be considered in important input parameters such as demands and routing costs and will be modeled through scenarios. The objective is to find a network design that is "good" across all scenarios potentially realizable. A heuristic method based on Benders Decomposition and Tabu Search is proposed that finds an initial solution which will be improved in an iterative fashion until lies within p% of the optimal or near-optimal solution for any realizable input data scenario.