Selective pricing in branch-price-and-cut algorithms for vehicle routing
- 135 Downloads
Branch-price-and-cut is a leading methodology for solving various vehicle routing problems (VRPs). For many VRPs, the pricing subproblem of a branch-price-and-cut algorithm is highly time consuming, and to alleviate this difficulty, a relaxed pricing subproblem is used. In this paper, we introduce a new paradigm, called selective pricing, that can be applied in this context to reduce the time required for solving hard-to-solve VRPs by branch-price-and-cut. This paradigm requires the development of a labeling algorithm specific to the pricing subproblem. To illustrate selective pricing, we apply it to a branch-price-and-cut algorithm for the VRP with time windows, where the relaxed pricing subproblem is a shortest ng-path problem with resource constraints. We develop a labeling algorithm for this subproblem and show through computational experiments that it can yield significant time reductions (up to 32%) to reach a good lower bound on certain very-hard-to-solve VRPTW instances with 200 customers. We also introduce a new labeling heuristic which also leads to computational time reductions.
KeywordsColumn generation Vehicle routing problem Branch-and-price Shortest path problem under resource constraints Selective pricing
This work has been partially financed by the Natural Sciences and Engineering Research Council of Canada (NSERC), the Fonds de recherche du Québec-Nature et technologies (FRQNT) and the GERAD.
- Gehring H, Homberger J (2001) A parallel two-phase metaheuristic for routing problems with time windows. Asia Pac J Oper Res 18:35–47Google Scholar
- Pecin D, Contardo C, Desaulniers G, Uchoa E (2016) New enhancements for the exact solution of the vehicle routing problem with time windows. Technical Report G-2016-13, Cahiers du GERADGoogle Scholar
- Toth P, Vigo D (eds) (2014) Vehicle routing: problems, methods, and applications, MOS-SIAM series on optimization, 2nd edn. SIAM, PhiladelphiaGoogle Scholar