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

By Gábor Zsolt Nagy, Saïd Salhi. European Journal of Operational Research, 2005

500 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care (2013, unknown): “Heuristics for the VRPMB are given by (Nagy and Salhi, 2005) (Salhi and Nagy, 1999) (Wade and Salhi, 2004) (Reimann and Ulrich, 2006).”
The vehicle routing problem: A taxonomic review (2009, background): “As shown in Vogel and Weterbe (1984) and Reisman (1992), there are many other uses for such a classification scheme.”
A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery (2010, background): “The parallel algorithm was coded in Cþþ and it was tested on benchmark problems proposed by Dethloff [2], Salhi and Nagy [6] and Montané and Galv~ao [13].”
Static pickup and delivery problems: a classification scheme and survey (2007, methodology): “Another heuristic was developed by Nagy and Salhi (2005) for the VRPSPD with a maximum route length.”
A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service (2006, methodology): “We use the best neighbourhood , as defined by the two above criteria, to compare our algorithm with the algorithms of Dethloff [3] and Salhi and Nagy [4,7].”