Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems

Abstract

For the exact solution of many types of vehicle-routing problems, column-generation based algorithms have become predominant. The column-generation subproblems are then variants of the shortest-path problem with resource constraints which can be solved well with dynamic-programming labeling algorithms. For vehicle-routing problems with a pickup-and-delivery structure, the strongest known dominance between two labels requires the delivery triangle inequality (DTI) for reduced costs to hold. When the direction of labeling is altered from forward labeling to backward labeling, the DTI requirement becomes the pickup triangle inequality (PTI). DTI and PTI cannot be guaranteed at the same time. The consequence seemed to be that bidirectional labeling, one of the most successful acceleration techniques developed over the last years, is not applicable with the strong dominance on both directions for problems with a pickup-and-delivery structure. In this paper, we show that bidirectional labeling with the strong dominance rules in forward as well as backward direction is possible by using different cost matrices in the two directions. We adopt the both-sided strong bidirectional labeling approach to integrate the standard robust and non-robust cuts. Moreover, a recent acceleration technique that dynamically adjusts the bidirectional half-way point is implemented. Full-fledged branch-cut-and-price algorithms are tested on the pickup-and-delivery problem with time windows (PDPTW). In particular, an in-depth analysis of different mono- and bidirectional labeling algorithms is presented. Overall, compared to the standard pure forward labeling-based algorithm, we obtain average reductions in computation time of more than 40 percent when solving PDPTW instances exactly.