Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries

@article{Nagy2005HeuristicAF,
  title={Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries},
  author={G{\'a}bor Nagy and Sa{\"i}d Salhi},
  journal={European Journal of Operational Research},
  year={2005},
  volume={162},
  pages={126-141}
}
The Vehicle Routing Problem with Pickups and Deliveries (VRPPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods. We do not make the assumption common in the VRPPD literature, that goods may only be picked up after all deliveries have been completed. We also eschew the concept of insertion and propose a method that treats pickups and deliveries in an integrated manner. This method finds a solution to the corresponding VRP problem… CONTINUE READING
BETA

Figures, Tables, and Topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
SHOWING 1-10 OF 201 CITATIONS

FILTER CITATIONS BY YEAR

2005
2019

CITATION STATISTICS

  • 23 Highly Influenced Citations

  • Averaged 15 Citations per year over the last 3 years

Similar Papers

Loading similar papers…