An Exact Algorithm for Multi Depot and Multi Period Vehicle Scheduling Problem

This study is on the multi period vehicle scheduling problem in a supply chain where a fleet of vehicle delivers single type product from multi depots to multi retailers. The purpose of this model is to design the least costly schedule of vehicles in each depot to minimize transportation costs for product delivery and inventory holding costs at retailers over the planning period. A mixed integer programming formulation and an exact algorithm are suggested. In the exact algorithm, all feasible schedules are generated from each depot to each retailer and set of vehicle schedules are selected optimally by solving the shortest path problem. The effectiveness of the proposed procedure is evaluated by computational experiment.

[1]  Niaz A. Wassan,et al.  A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls , 2002 .

[2]  Gilbert Laporte,et al.  Classical and modern heuristics for the vehicle routing problem , 2000 .

[3]  Said Salhi,et al.  Incorporating vehicle routing into the vehicle fleet composition problem , 1993 .

[4]  Hokey Min,et al.  Supply chain modeling: past, present and future , 2002 .

[5]  Yeong-Dae Kim,et al.  A decomposition approach to a multi-period vehicle scheduling problem , 1999 .

[6]  Alan Slater,et al.  Specification for a dynamic vehicle routing and scheduling system , 2002 .

[7]  Daniel Granot,et al.  The vehicle routing problem with pickups and deliveries on some special graphs , 2002, Discret. Appl. Math..

[8]  Mohamed Barkaoui,et al.  A parallel hybrid genetic algorithm for the vehicle routing problem with time windows , 2004, Comput. Oper. Res..

[9]  Gilbert Laporte,et al.  Integer programming formulations for the multi-depot vehicle routing problem: Comments on a paper by Kulkarni and Bhave , 1989 .

[10]  George Nikolakopoulou,et al.  Solving a vehicle routing problem by balancing the vehicles time utilization , 2004, Eur. J. Oper. Res..

[11]  Dalessandro Soares Vianna,et al.  A parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet , 1998, Future Gener. Comput. Syst..

[12]  Paolo Toth,et al.  Fast Local Search Algorithms for the Handicapped Persons Transportation Problem , 1996 .

[13]  Chryssi Malandraki,et al.  A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem , 1996 .

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

[15]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[16]  Said Salhi,et al.  A multi-level composite heuristic for the multi-depot vehicle fleet mix problem , 1997 .

[17]  Andrea Lodi,et al.  Two-dimensional packing problems: A survey , 2002, Eur. J. Oper. Res..

[18]  Gerard Sierksma,et al.  Routing helicopters for crew exchanges on off-shore locations , 1998, Ann. Oper. Res..

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

[20]  J. Y. Yen.  Finding the K Shortest Loopless Paths in a Network , 1971 .

[21]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

[22]  Michel Gendreau,et al.  A PARALLEL TABU SEARCH HEURISTIC FOR THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS , 1997 .

[23]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

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

[25]  Hoong Chuin Lau,et al.  Vehicle routing problem with time windows and a limited number of vehicles , 2003, Eur. J. Oper. Res..

[26]  Christos D. Tarantilis,et al.  Using a spatial decision support system for solving the vehicle routing problem , 2002, Inf. Manag..

[27]  Paolo Toth,et al.  An Overview of Vehicle Routing Problems , 2002, The Vehicle Routing Problem.

[28]  Fuh-Hwa Franklin Liu,et al.  A route-neighborhood-based metaheuristic for vehicle routing problem with time windows , 1999, Eur. J. Oper. Res..

[29]  Edward P. K. Tsang,et al.  Guided local search and its application to the traveling salesman problem , 1999, Eur. J. Oper. Res..

[30]  Greg Riccardi.  Principles of Database Systems with Internet and Java Applications , 2002 .

[31]  Jacques Renaud,et al.  A sweep-based algorithm for the fleet size and mix vehicle routing problem , 2002, Eur. J. Oper. Res..

[32]  Catherine Roucairol,et al.  A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem , 1996 .

[33]  Hermann A. Maurer,et al.  From Databases to Hypermedia , 1998, Springer Berlin Heidelberg.

[34]  Michel Gendreau,et al.  A tabu search heuristic for the heterogeneous fleet vehicle routing problem , 1999, Comput. Oper. Res..