Publicación:
LAGRANGEAN RELAXATION HEURISTIC FOR THE PCABLE-TRENCH PROBLEM

Vista sencilla de ítem
dc.creatorCARLOS ENRIQUE OBREQUE NÍÑEZ
dc.date2012
dc.date.accessioned2025-01-10T14:43:35Z
dc.date.available2025-01-10T14:43:35Z
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.
dc.formatapplication/pdf
dc.identifier.doi10.1016/j.cor.2011.05.015
dc.identifier.issn1873-765X
dc.identifier.issn0305-0548
dc.identifier.urihttps://repositorio.ubiobio.cl/handle/123456789/8699
dc.languagespa
dc.publisherCOMPUTERS AND OPERATIONS RESEARCH
dc.relation.uri10.1016/j.cor.2011.05.015
dc.rightsPUBLICADA
dc.titleLAGRANGEAN RELAXATION HEURISTIC FOR THE PCABLE-TRENCH PROBLEM
dc.typeARTÍCULO
dspace.entity.typePublication
ubb.EstadoPUBLICADA
ubb.Otra ReparticionDEPARTAMENTO DE INGENIERIA INDUSTRIAL
ubb.SedeCONCEPCIÓN
Archivos
Colecciones
Artículos científicos