Vehicle capacity planning system: a case study on vehicle routing problem with time windows

In this paper, we consider a local logistic company that provides transportation service for moving empty and laden containers within Singapore. Due to the limited capacity of its own fleet of vehicles, the company cannot handle all the job orders and have to outsource some orders to other smaller local transportation companies. The current operation of assigning jobs for outsourcing goes through two steps. In the first step, a certain percentage of jobs will be preselected for outsourcing according to some simple rules. Then at the second step, the rest of the jobs will be put into an in-house computer system which assigns jobs to its internal fleet of vehicles according to some greedy rules and the remaining jobs that cannot be served by the internal fleet of vehicles will be outsourced. This paper presents a vehicle capacity planning system (VCPS), which models the problem as a vehicle routing problem with time window constraints (VRPTW) and tabu search (TS) is applied to find a solution for the problem. From the simulation results, some new rules on how to assign jobs for outsourcing are derived, which are shown to be about 8% better than existing rules currently adopted by the company.

[1]  Paul M. Thompson,et al.  Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems , 1993, Oper. Res..

[2]  Gérard Cornuéjols,et al.  Polyhedral study of the capacitated vehicle routing problem , 1993, Math. Program..

[3]  Robert A. Russell,et al.  Technical Note - An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions , 1977, Oper. Res..

[4]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[5]  Lawrence Bodin,et al.  THE STATE OF THE ART IN THE ROUTING AND SCHEDULING OF VEHICLES AND CREWS: EXECUTIVE SUMMARY , 1981 .

[6]  John E. Beasley,et al.  Route first--Cluster second methods for vehicle routing , 1983 .

[7]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

[8]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[9]  David Simchi-Levi,et al.  A Location Based Heuristic for General Routing Problems , 1995, Oper. Res..

[10]  Billy E. Gillett,et al.  A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..

[11]  Jean-Yves Potvin,et al.  The Vehicle Routing Problem with Time Windows Part I: Tabu Search , 1996, INFORMS J. Comput..

[12]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[13]  Alexander H. G. Rinnooy Kan,et al.  Vehicle Routing with Time Windows , 1987, Oper. Res..

[14]  Nicos Christofides,et al.  Capacitated clustering problems by hybrid simulated annealing and tabu search , 1994 .

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

[16]  David Simchi-Levi,et al.  A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty , 1996, Oper. Res..

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

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

[19]  Samuel J. Raff,et al.  Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..

[20]  Marshall L. Fisher,et al.  Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees , 1994, Oper. Res..

[21]  Jean-Yves Potvin,et al.  A parallel implementation of the Tabu search heuristic for vehicle routing problems with time window constraints , 1994, Comput. Oper. Res..

[22]  Loo Hay Lee,et al.  Heuristic methods for vehicle routing problem with time windows , 2001, Artif. Intell. Eng..

[23]  Jacques Desrosiers,et al.  2-Path Cuts for the Vehicle Routing Problem with Time Windows , 1997, Transp. Sci..

[24]  Wen-Chyuan Chiang,et al.  A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows , 1997, INFORMS J. Comput..

[25]  Niklas Kohl,et al.  An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation , 1997, Oper. Res..

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

[27]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[28]  Marshall L. Fisher,et al.  Chapter 1 Vehicle routing , 1995 .

[29]  P. C. Yellow,et al.  A Computational Modification to the Savings Method of Vehicle Scheduling , 1970 .

[30]  T. J. Gaskell,et al.  Bases for Vehicle Fleet Scheduling , 1967 .

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

[32]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[33]  David Simchi-Levi,et al.  Analysis of vehicle routing and inventory-routing problems , 1995 .

[34]  Tong Sun,et al.  Algorithms for the vehicle routing problems with time deadlines , 1993 .