Load-dependent and precedence-based models for pickup and delivery problems
We present models for pickup and delivery traveling salesman problems. Important relations between different problem variants are shown. New valid inequalities for precedence relations are introduced. Our branch-and-cut algorithms outperform existing approaches. Several open instances for the sequential ordering problem are solved.
pickup and delivery traveling salesman sequential ordering problem transportation precedence constraints