Benders decomposition for Network Design Covering Problems
From MaRDI portal
Publication:6345006
DOI10.1016/J.COR.2021.105417arXiv2007.06647MaRDI QIDQ6345006FDOQ6345006
Authors: Víctor Bucarey, Bernard Fortz, Natividad González-Blanco, Martine Labbé, Juan A. Mesa 
Publication date: 13 July 2020
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.
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Mixed integer programming (90C11)
This page was built for publication: Benders decomposition for Network Design Covering Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6345006)
