This study proposes a branch-and-price algorithm to solve the Location-Routing Problem with Time Windows (LRPTW) which has never been attempted with the exact solutions before. The problem is solved by the simplex algorithm in the master problem and elementary shortest path problems with resource constraint corresponding to column generation in the subproblem until only the non-negative reduced cost columns remain. The proposed algorithm can solve many testing instances effectively. The computational results and the effect of time windows are also compared and discussed.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Branch-and-price algorithm for the location-routing problem with time windows



    Published in:

    Publication date :

    2016




    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English



    Classification :

    BKL:    85.00 / 55.82 Güterverkehr



    Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows

    Dabia, S. / Ropke, S. / van Woensel, T. et al. | British Library Online Contents | 2013



    Branch and cut and price for the time dependent vehicle routing problem with time windows

    Dabia, S. / Röpke, S. / Woensel, van, T. et al. | BASE | 2011

    Free access


    Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Problem with Time Windows

    Rothenbächer, Ann-Kathrin / Drexl, Michael / Irnich, Stefan | British Library Online Contents | 2018