A branch-and-price algorithm for the robust single-source capacitated facility location problem under demand uncertainty

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 56
  • Download : 0
We consider the robust single-source capacitated facility location problem with uncertainty in customer demands. A cardinality-constrained uncertainty set is assumed for the robust problem. To solve it efficiently, we propose an allocation-based formulation derived by Dantzig-Wolfe decomposition and a branch-and-price algorithm. The computational experiments show that our branch-and-price algorithm outperforms CPLEX in many cases, which solves the ordinary robust reformulation. We also examine the trade-off relationship between the empirical probability of infeasibility and the additional costs incurred and observe that the robustness of solutions can be improved significantly with small additional costs.
Publisher
ELSEVIER
Issue Date
2022-02
Language
English
Article Type
Article
Citation

EURO JOURNAL ON TRANSPORTATION AND LOGISTICS, v.11

ISSN
2192-4376
DOI
10.1016/j.ejtl.2021.100069
URI
http://hdl.handle.net/10203/292341
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0