RT journal article
T1 Exact solution method for stochastic single-allocation hub location problems
A1 Espejo Miranda, Inmaculada
A1 Marín, A.
A1 Muñoz Ocaña, Juan Manuel
A1 Páez Jiménez, Raúl
A1 Rodríguez Chía, Antonio Manuel
A2 Estadística e Investigación Operativa
K1 Stochastic
K1 Hub
K1 Single allocation
K1 Capacity
K1 Branch-and-cut
AB problem with single allocation, incorporating uncertainties in origin–destination flows, transportation costs, and hub capacities. A scenario-based model is used to minimize the expectedoverall costs, requiring two decisions: (i) the location of hubs, which remains fixed across allscenarios; and (ii) the allocation of each origin/destination to one of these hubs in each scenario.We propose a compact mixed-integer linear programming formulation strengthened by validinequalities. A branch-and-cut algorithm is developed to obtain optimal solutions, starting witha constraint-relaxed formulation after applying a preprocessing phase to fix variables, followedby the addition of cuts via smart separation methods. Computational results demonstrate thatthis solution procedure outperforms existing methods, even for specialized versions of the modelintroduced in this paper.
PB Elsevier
SN 1366-5545
YR 2025
FD 2025-07-24
LK http://hdl.handle.net/10498/37906
UL http://hdl.handle.net/10498/37906
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 07-nov-2026