Lagrangean relaxation heuristics for the p-cable-trench problem

dc.creatorMarianov, Vladimir
dc.creatorGutierrez Jarpa, Gabriel
dc.creatorObreque, Carlos
dc.creatorCornejo, Oscar
dc.date.accessioned2024-01-10T12:39:58Z
dc.date.accessioned2024-05-02T19:50:48Z
dc.date.available2024-01-10T12:39:58Z
dc.date.available2024-05-02T19:50:48Z
dc.date.created2024-01-10T12:39:58Z
dc.date.issued2012
dc.identifier10.1016/j.cor.2011.05.015
dc.identifier0305-0548
dc.identifierhttps://doi.org/10.1016/j.cor.2011.05.015
dc.identifierhttps://repositorio.uc.cl/handle/11534/77256
dc.identifierWOS:000295302100014
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/9273000
dc.description.abstractWe 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. (C) 2011 Elsevier Ltd. All rights reserved.
dc.languageen
dc.publisherPERGAMON-ELSEVIER SCIENCE LTD
dc.rightsacceso restringido
dc.subjectLocation
dc.subjectNetwork design
dc.subjectLagrangean relaxation heuristics
dc.subjectNETWORK DESIGN PROBLEM
dc.subjectMEDIAN PROBLEM
dc.subjectLOCATION
dc.subjectMODEL
dc.subjectGRAPH
dc.titleLagrangean relaxation heuristics for the p-cable-trench problem
dc.typeartículo


Este ítem pertenece a la siguiente institución