Development of a Planning System for the Routing and Scheduling of Vehicles in Pickup and Delivery Services

In this paper, we develop a planning system for the routing and scheduling of vehicles in pickup and delivery service such as door-to-door parcel service. Efficient routing and scheduling of vehicles is very important in pickup and delivery service. The routing and scheduling problem is a variation of vehicle routing problem which has various realistic constraints. We develop a heuristic algorithm based on tabu search to solve the routing and scheduling problem. We develop a routing and scheduling system installed the algorithm as a planning engine. The system manage the basic data and uses GIS data to make a realistic route plan.

[1]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[2]  M. Goetschalckx,et al.  The vehicle routing problem with backhauls , 1989 .

[3]  Gilbert Laporte,et al.  An Improved Petal Heuristic for the Vehicle Routeing Problem , 1996 .

[4]  Alan Mercer,et al.  The multi-trip vehicle routing problem , 1998, J. Oper. Res. Soc..

[5]  Minghe Sun,et al.  Applying GIS and Combinatorial Optimization to Fiber Deployment Plans , 1999, J. Heuristics.

[6]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[7]  G. Laporte,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

[8]  Gur Mosheiov,et al.  Vehicle routing with pick-up and delivery: tour-partitioning heuristics , 1998 .

[9]  Paolo Toth,et al.  The Granular Tabu Search and Its Application to the Vehicle-Routing Problem , 2003, INFORMS J. Comput..

[10]  J. Wesley Barnes,et al.  Solving the Pickup and Delivery Problem with Time Windows Using Reactive Tabu Search Transportation , 2000 .

[11]  Paolo Toth,et al.  A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls , 1999, Eur. J. Oper. Res..

[12]  Bruce L. Golden,et al.  A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions , 1993 .

[13]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[14]  A. Tsakalidis,et al.  Integrating GIS, GPS and GSM technologies for the effective management of ambulances , 2001 .

[15]  Nicos Christofides,et al.  The vehicle routing problem , 1976, Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle.

[16]  Nicos Christofides,et al.  An Algorithm for the Vehicle-dispatching Problem , 1969 .

[17]  Gilbert Laporte,et al.  A tabu search heuristic for the multi-depot vehicle routing problem , 1996, Comput. Oper. Res..

[18]  Jean-Yves Potvin,et al.  Heuristic approaches to vehicle routing with backhauls and time windows , 1996, Comput. Oper. Res..

[19]  Michel Gendreau,et al.  Vehicle Routeing with Multiple Use of Vehicles , 1996 .