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.
Branch-and-price algorithm for the location-routing problem with time windows
Transportation research / E ; 86 ; 1-19
2016
Aufsatz (Zeitschrift)
Englisch
Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows
British Library Online Contents | 2013
|Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows
Online Contents | 2013
|Branch and cut and price for the time dependent vehicle routing problem with time windows
BASE | 2011
|Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Problem with Time Windows
British Library Online Contents | 2018
|