Lagrangean relaxation heuristics for the p-cable-trench problem

Simple item page
dc.contributor.authorMarianov, Vladimir
dc.contributor.authorGutierrez Jarpa, Gabriel
dc.contributor.authorObreque, Carlos
dc.contributor.authorCornejo, Oscar
dc.date.accessioned2024-01-10T12:39:58Z
dc.date.available2024-01-10T12:39:58Z
dc.date.issued2012
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.description.funderDireccion de Investigacion de la Universidad Catolica de la Santisima Concepcion
dc.description.funderInstituto Milenio Complex Engineering Systems
dc.description.funderFONDECYT
dc.fechaingreso.objetodigital2024-04-02
dc.format.extent9 páginas
dc.fuente.origenWOS
dc.identifier.doi10.1016/j.cor.2011.05.015
dc.identifier.issn0305-0548
dc.identifier.urihttps://doi.org/10.1016/j.cor.2011.05.015
dc.identifier.urihttps://repositorio.uc.cl/handle/11534/77256
dc.identifier.wosidWOS:000295302100014
dc.information.autorucIngeniería;Marianov V;S/I;99349
dc.issue.numero3
dc.language.isoen
dc.nota.accesocontenido parcial
dc.pagina.final628
dc.pagina.inicio620
dc.publisherPERGAMON-ELSEVIER SCIENCE LTD
dc.revistaCOMPUTERS & OPERATIONS RESEARCH
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
dc.volumen39
sipa.codpersvinculados99349
sipa.indexWOS
sipa.indexScopus
sipa.trazabilidadCarga SIPA;09-01-2024
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Lagrangean relaxation heuristics for the p-cable-trench problem.pdf
Size:
2.44 KB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Artículos de revistas