dc.creator | Bucarey, Víctor | es |
dc.creator | Fortz, Bernard | es |
dc.creator | González Blanco, Natividad | es |
dc.creator | Labbé, Martine | es |
dc.creator | Mesa López-Colmenar, Juan Antonio | es |
dc.date.accessioned | 2022-03-10T17:14:23Z | |
dc.date.available | 2022-03-10T17:14:23Z | |
dc.date.issued | 2022 | |
dc.identifier.citation | Bucarey, 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.issn | 0305-0548 | es |
dc.identifier.uri | https://hdl.handle.net/11441/130676 | |
dc.description | Article number 105417 | es |
dc.description.abstract | We 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.sponsorship | Feder (UE) PID2019- 106205GB-I00 | es |
dc.description.sponsorship | FEDER(UE) MTM2015-67706-P | es |
dc.description.sponsorship | Fonds de la Recherche Scientifique PDR T0098.18 | es |
dc.format | application/pdf | es |
dc.format.extent | 15 p. | es |
dc.language.iso | eng | es |
dc.publisher | Publisher Elsevier Ltd | es |
dc.relation.ispartof | Computers and Operations Research, 137, Article number 105417. | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | Facility planning and design | es |
dc.subject | Benders decomposition | es |
dc.subject | Network design | es |
dc.subject | Rapid transit network | es |
dc.title | Benders decomposition for network design covering problems | es |
dc.type | info:eu-repo/semantics/article | es |
dc.type.version | info:eu-repo/semantics/publishedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Matemática Aplicada II (ETSI) | es |
dc.relation.projectID | PID2019- 106205GB-I00 | es |
dc.relation.projectID | MTM2015-67706-P | es |
dc.relation.projectID | PDR T0098.18 | es |
dc.relation.publisherversion | https://www.sciencedirect.com/science/article/pii/S0305054821001805 | es |
dc.identifier.doi | 10.1016/j.cor.2021.105417 | es |
dc.journaltitle | Computers and Operations Research | es |
dc.publication.volumen | 137 | es |
dc.publication.initialPage | Article number 105417 | es |
dc.contributor.funder | Ministerio de Ciencia y Tecnología(España) | es |
dc.contributor.funder | Ministerio de Economía y Competitividad (España) | es |