A constructive procedure for finding good starting solutions to the network design problem with uncertain parameters

Authors:
Fernando Pérez;Ada M. Alvarez;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:
AMCOS'05 Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science
Year:
2005

Citing 3
Cited 0

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

Management Science
Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory

INFORMS Journal on Computing
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. At the present time, there exists no exact algorithm that can solve large instances, common in several applications, in a reasonable period of time. A GRASP is proposed that gives solutions of acceptable quality.