Lagrangean relaxation heuristics for the p-cable-trench problem

Authors:
Vladimir Marianov;Gabriel Gutiérrez-Jarpa;Carlos Obreque;Oscar Cornejo
Affiliations:
Department of Electrical Engineering, Pontificia Universidad Católica de Chile, Santiago, Chile;School of Industrial Engineering, Pontificia Universidad Católica de Valparaíso, Valparaíso, Chile;Department of Industrial Engineering, Universidad del Bío-Bío, Concepción, Chile;Department of Industrial Engineering, Universidad Católica de la Santísima Concepción, Concepción, Chile
Venue:
Computers and Operations Research
Year:
2012

Citing 5
Cited 0

The cable trench problem: combining the shortest path and minimum spanning tree problems

Computers and Operations Research
Solution methods for the p-median problem: An annotated bibliography

Networks
A neural model for the p-median problem

Computers and Operations Research
Application of Genetic Algorithm to Network Design Problem

ICICTA '08 Proceedings of the 2008 International Conference on Intelligent Computation Technology and Automation - Volume 01
A capacity scaling heuristic for the multicommodity capacitated network design problem

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.01

Visualization

Abstract

We address the p-cable-trench problem. In this problem, p facilities are located, a trench network is dug and cables are laid in the trenches, so that every customer - or demand - in the region is connected to a facility through a cable. The digging cost of the trenches, as well as the sum of the cable lengths between the customers and their assigned facilities, are minimized. We formulate an integer programming model of the problem using multicommodity flows that allows finding the solution for instances of up to 200 nodes. We also propose two Lagrangean Relaxation-based heuristics to solve larger instances of the problem. Computational experience is provided for instances of up to 300 nodes.