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.


    Access

    Download


    Export, share and cite



    Title :

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


    Contributors:
    Jaehyeon Ryu (author) / Sungsoo Park (author)


    Publication date :

    2022




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown




    A Branch-and-Cut algorithm for the Single Source Capacitated Facility Location problem

    Avella, Pasquale / Boccia, Maurizio / Mattia, Sara | IEEE | 2013


    Branch-and-Cut-and-Price for Capacitated Connected Facility Location

    Leitner, M. / Raidl, G. n. | British Library Online Contents | 2011



    Reliable capacitated facility location problem with service levels

    Santiváñez, José A. / Carlo, Héctor J. | Online Contents | 2018