Robust Supply Vessel Planning

In the supply vessel planning problem, a set of offshore installations receives supplies from an onshore supply depot on a regular basis. This service is performed by a fleet of offshore supply vessels. The supply vessel planning problem then consists of determining the optimal fleet size and mix of supply vessels and the corresponding weekly voyages and schedules. This is a real planning problem faced by among others the energy company Statoil. In a previous study this problem was examined and a deterministic voyage based solution approach presented. In this study we address the problem of creating robust schedules to the supply vessel planning problem. Several approaches are tested and compared in a computational study, and the results show that there is an improvement potential if some robustness considerations are made when finding a solution to the supply vessel planning problem.

[1]  Jay M. Rosenberger,et al.  A Branch-and-Price-and-Cut Method for Ship Scheduling with Limited Risk , 2008, Transp. Sci..

[2]  Kjetil Fagerholt,et al.  Robust ship scheduling with multiple time windows , 2002 .

[3]  Stephen C. H. Leung,et al.  Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithm , 2010 .

[4]  Kjetil Fagerholt,et al.  Optimal fleet design in a ship routing problem , 1999 .

[5]  Gilbert Laporte,et al.  A tabu search heuristic for a routing problem arising in servicing of offshore oil and gas platforms , 2008, J. Oper. Res. Soc..

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

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

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

[9]  El Houssaine Aghezzaf.  Robust distribution planning for supplier-managed inventory agreements when demand rates and travel times are stationary , 2008, J. Oper. Res. Soc..

[10]  Michael C. Fu,et al.  Feature Article: Optimization for simulation: Theory vs. Practice , 2002, INFORMS J. Comput..

[11]  Sheldon M. Ross.  Introduction to Probability Models. , 1995 .

[12]  Michael C. Fu,et al.  Optimization for Simulation: Theory vs. Practice , 2002 .

[13]  Sheldon M. Ross,et al.  Introduction to Probability Models, Eighth Edition , 1972 .

[14]  Richard F. Hartl,et al.  A variable neighborhood search heuristic for periodic routing problems , 2009, Eur. J. Oper. Res..

[15]  Marco A. Duran,et al.  Logistics for world-wide crude oil transportation using discrete event simulation and optimal control , 2004, Comput. Chem. Eng..

[16]  Alan Mercer,et al.  A tabu search algorithm for the multi-trip vehicle routing and scheduling problem , 1997, Eur. J. Oper. Res..

[17]  Gilbert Laporte,et al.  STOCHASTIC VEHICLE ROUTING. , 1996 .

[18]  Angel A. Juan,et al.  Using safety stocks and simulation to solve the vehicle routing problem with stochastic demands , 2011 .

[19]  John E. Beasley,et al.  A heuristic algorithm for the period vehicle routing problem , 1984 .

[20]  Marielle Christiansen,et al.  Industrial aspects and literature survey: Fleet composition and routing , 2010, Comput. Oper. Res..

[21]  Kjetil Fagerholt,et al.  A decision support methodology for strategic planning in maritime transportation , 2010 .

[22]  Lawrence Bodin,et al.  Networks and vehicle routing for municipal waste collection , 1974, Networks.

[23]  Kenneth Sörensen,et al.  A Practical Approach for Robust and Flexible Vehicle Routing Using Metaheuristics and Monte Carlo Sampling , 2009, J. Math. Model. Algorithms.

[24]  Kjetil Fagerholt,et al.  Optimal policies for maintaining a supply service in the Norwegian Sea , 2000 .

[25]  Fred W. Glover,et al.  Enhancing Business Process Management with Simulation Optimization , 2006, Proceedings of the 2006 Winter Simulation Conference.