Generalised pickup and delivery problem with dynamic time windows

This paper considers the general class of vehicle routing problems in which nodes may be visited multiple times by multiple vehicles. The vehicles must pickup a product under continuous production at nodes and deliver it to a central depot. The nodes must be visited within certain time windows which are dependent on product availability at the nodes and the routes taken by vehicles, hence, the term, dynamic time windows. A model formulation is proposed using mixed-integer programming, along with two different performance metrics for tour optimisation: total product delivery at the depot, and another associated with rate of product delivery. The MIPs with non-linear objective functions are solved through a new convergent iterative algorithm in which sequences of parametric mixed-integer linear programmes are solved. The model is applied to a real-world situation that involves scheduling barges for oil pickup from offshore oil platforms. Preliminary computational results are presented.

[1]  Gilbert Laporte,et al.  A unified tabu search heuristic for vehicle routing problems with time windows , 2001, J. Oper. Res. Soc..

[2]  L. Bodin ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .

[3]  Edward K. Baker,et al.  Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints , 1986 .

[4]  H. Psaraftis An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time Windows , 1983 .

[5]  Goos Kant,et al.  Coca-Cola Enterprises Optimizes Vehicle Routes for Efficient Product Delivery , 2008, Interfaces.

[6]  Yves Rochat,et al.  A Tabu Search Approach for Delivering Pet Food and Flour in Switzerland , 1994 .

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

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

[9]  H. Van Landeghem,et al.  A bi-criteria heuristic for the vehicle routing problem with time windows , 1988 .

[10]  Jens Lysgaard,et al.  Dynamic Transportation Networks in Vehicle Routing and Scheduling , 1992 .

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

[12]  Carlos F. Daganzo Modeling Distribution Problems with Time Windows. Part II: Two Customer Types , 1987, Transp. Sci..

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

[14]  Martin W. P. Savelsbergh,et al.  Local search in routing problems with time windows , 1984 .

[15]  J. Desrosiers,et al.  Methods for routing with time windows , 1986 .

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

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

[18]  Brian Kallehauge,et al.  Formulations and exact algorithms for the vehicle routing problem with time windows , 2008, Comput. Oper. Res..

[19]  Abraham Charnes,et al.  Programming with linear fractional functionals , 1962 .

[20]  J. Ferland,et al.  Vehicles scheduling with sliding time windows , 1989 .

[21]  Marielle Christiansen,et al.  Decomposition of a Combined Inventory and Time Constrained Ship Routing Problem , 1999, Transp. Sci..

[22]  Jacques Desrosiers,et al.  Survey Paper - Time Window Constrained Routing and Scheduling Problems , 1988, Transp. Sci..

[23]  Jacques Desrosiers,et al.  Time Constrained Routing and Scheduling , 1992 .

[24]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part II: Metaheuristics , 2005, Transp. Sci..

[25]  David Pisinger,et al.  A general heuristic for vehicle routing problems , 2007, Comput. Oper. Res..

[26]  Gilbert Laporte,et al.  Solving a vehicle-routing problem arising in soft-drink distribution , 2006, J. Oper. Res. Soc..

[27]  Leon S. Lasdon,et al.  Optimization Theory of Large Systems , 1970 .

[28]  Jean-Yves Potvin,et al.  A parallel route building algorithm for the vehicle routing and scheduling problem with time windows , 1993 .

[29]  Paolo Toth,et al.  State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.

[30]  F.-H. Liu,et al.  The fleet size and mix vehicle routing problem with time windows , 1999, J. Oper. Res. Soc..

[31]  Geraldo Robson Mateus,et al.  A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows , 2007, Comput. Oper. Res..

[32]  Jacques Desrosiers,et al.  The Pickup and Delivery Problem with Time Windows , 1989 .

[33]  Jean-Yves Potvin,et al.  An Exchange Heuristic for Routeing Problems with Time Windows , 1995 .

[34]  Massimiliano Caramia,et al.  Experimenting crossover operators to solve the vehicle routing problem with time windows by Genetic Algorithms , 2008 .

[35]  Stuart Johns Heuristics to Schedule Service Engineers within Time Windows , 1995 .

[36]  Thomas L. Magnanti,et al.  Combinatorial optimization and vehicle fleet planning: Perspectives and prospects , 1981, Networks.

[37]  W B Powell,et al.  APPLICATION OF OPTIMIZATION BASED MODELS ON VEHICLE ROUTING AND SCHEDULING PROBLEMS WITH TIME WINDOW CONSTRAINTS , 1990 .

[38]  Marielle Christiansen,et al.  A method for solving ship routing problemswith inventory constraints , 1998, Ann. Oper. Res..

[39]  Carlos F. Daganzo,et al.  Modeling Distribution Problems with Time Windows: Part I , 1987, Transp. Sci..

[40]  Byung-In Kim,et al.  Waste collection vehicle routing problem with time windows using multi-objective genetic algorithms , 2007 .