Abstract

We present a branch-and-price algorithm for the vehicle routing problem with simultaneous pick-up and delivery (VRPSPD), where each customer requires both a delivery and a pickup in the same visit. The pricing subproblem is solved using dynamic programming with resource constraints.

Vehicle RoutingBranch and PriceCombinatorial Optimization

BibTeX

@article{dell2006branch,
  title={A branch-and-price algorithm for the vehicle routing problem with simultaneous pick-up and delivery},
  author={Dell'Amico, Mauro and Righini, G and Salani, M},
  journal={Transportation Sciences},
  volume={40},
  pages={235--247},
  year={2006}
}