Show simple item record

Article

dc.creatorBucarey, Víctores
dc.creatorFortz, Bernardes
dc.creatorGonzález Blanco, Natividades
dc.creatorLabbé, Martinees
dc.creatorMesa López-Colmenar, Juan Antonioes
dc.date.accessioned2022-03-10T17:14:23Z
dc.date.available2022-03-10T17:14:23Z
dc.date.issued2022
dc.identifier.citationBucarey, V., Fortz, B., González Blanco, N., Labbé, M. y Mesa López-Colmenar, J.A. (2022). Benders decomposition for network design covering problems. Computers and Operations Research, 137, Article number 105417.
dc.identifier.issn0305-0548es
dc.identifier.urihttps://hdl.handle.net/11441/130676
dc.descriptionArticle number 105417es
dc.description.abstractWe consider two covering variants of the network design problem. We are given a set of origin/destination pairs, called O/D pairs, and each such O/D pair is covered if there exists a path in the network from the origin to the destination whose length is not larger than a given threshold. In the first problem, called the Maximal Covering Network Design problem, one must determine a network that maximizes the total fulfilled demand of the covered O/D pairs subject to a budget constraint on the design costs of the network. In the second problem, called the Partial Covering Network Design problem, the design cost is minimized while a lower bound is set on the total demand covered. After presenting formulations, we develop a Benders decomposition approach to solve the problems. Further, we consider several stabilization methods to determine Benders cuts as well as the addition of cut-set inequalities to the master problem. We also consider the impact of adding an initial solution to our methods. Computational experiments show the efficiency of these different aspects.es
dc.description.sponsorshipFeder (UE) PID2019- 106205GB-I00es
dc.description.sponsorshipFEDER(UE) MTM2015-67706-Pes
dc.description.sponsorshipFonds de la Recherche Scientifique PDR T0098.18es
dc.formatapplication/pdfes
dc.format.extent15 p.es
dc.language.isoenges
dc.publisherPublisher Elsevier Ltdes
dc.relation.ispartofComputers and Operations Research, 137, Article number 105417.
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectFacility planning and designes
dc.subjectBenders decompositiones
dc.subjectNetwork designes
dc.subjectRapid transit networkes
dc.titleBenders decomposition for network design covering problemses
dc.typeinfo:eu-repo/semantics/articlees
dc.type.versioninfo:eu-repo/semantics/publishedVersiones
dc.rights.accessRightsinfo:eu-repo/semantics/openAccesses
dc.contributor.affiliationUniversidad de Sevilla. Departamento de Matemática Aplicada II (ETSI)es
dc.relation.projectIDPID2019- 106205GB-I00es
dc.relation.projectIDMTM2015-67706-Pes
dc.relation.projectIDPDR T0098.18es
dc.relation.publisherversionhttps://www.sciencedirect.com/science/article/pii/S0305054821001805es
dc.identifier.doi10.1016/j.cor.2021.105417es
dc.journaltitleComputers and Operations Researches
dc.publication.volumen137es
dc.publication.initialPageArticle number 105417es
dc.contributor.funderMinisterio de Ciencia y Tecnología(España)es
dc.contributor.funderMinisterio de Economía y Competitividad (España)es

FilesSizeFormatViewDescription
Benders decomposition for network ...1.133MbIcon   [PDF] View/Open  

This item appears in the following collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Except where otherwise noted, this item's license is described as: Attribution-NonCommercial-NoDerivatives 4.0 Internacional