Maritime crude oil transportation - A split pickup and split delivery problem

The maritime oil tanker routing and scheduling problem is known to the literature since before 1950. In the presented problem, oil tankers transport crude oil from supply points to demand locations around the globe. The objective is to find ship routes, load sizes, as well as port arrival and departure times, in a way that minimizes transportation costs. We introduce a path flow model where paths are ship routes. Continuous variables distribute the cargo between the different routes. Multiple products are transported by a heterogeneous fleet of tankers. Pickup and delivery requirements are not paired to cargos beforehand and arbitrary split of amounts is allowed. Small realistic test instances can be solved with route pre-generation for this model. The results indicate possible simplifications and stimulate further research.

[1]  Leif H. Appelgren,et al.  A Column Generation Algorithm for a Ship Scheduling Problem , 1969 .

[2]  Sophie N. Parragh,et al.  A survey on pickup and delivery problems Part I : Transportation between customers and depot , 2007 .

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

[4]  Kjetil Fagerholt,et al.  Ship Routing and Scheduling: Status and Perspectives , 2004, Transp. Sci..

[5]  Chelsea C. White,et al.  Pickup and Delivery with Split Loads , 2008, Transp. Sci..

[6]  Merrill M. Flood,et al.  Application of Transportation Theory to Scheduling a Military Tanker Fleet , 1954, Oper. Res..

[7]  HANIF D. Sherali,et al.  Fleet management models and algorithms for an oil-tanker routing and scheduling problem , 1999 .

[8]  Richard F. Hartl,et al.  A survey on pickup and delivery problems , 2008 .

[9]  Gilbert Laporte,et al.  Rejoinder on: Static pickup and delivery problems: a classification scheme and survey , 2007 .

[10]  B. Golden,et al.  Models and branch-and-cut algorithms for pickup and delivery problems with time windows , 2007 .

[11]  Lawrence E. Briskin.  Selecting Delivery Dates in the Tanker Scheduling Problem , 1966 .

[12]  W. M. Bremer,et al.  An operational tanker scheduling optimization system: background, current practice and model formulation , 1992 .

[13]  Mandell Bellmore,et al.  A maximum utility solution to a vehicle constrained tanker scheduling problem , 1968 .

[14]  E. D. Chajakis.  Management Science for Marine Petroleum Logistics , 2000 .

[15]  M. Bellmore,et al.  A Multivehicle Tanker Scheduling Problem , 1971 .

[16]  Jan A. Persson,et al.  Shipment planning at oil refineries using column generation and valid inequalities , 2005, Eur. J. Oper. Res..

[17]  D. R. Fulkerson,et al.  MINIMIZING THE NUMBER OF CARRIERS TO MEET A FIXED SCHEDULE , 1954 .

[18]  Gerald G. Brown,et al.  Scheduling ocean transportation of crude oil , 1987 .

[19]  Salem Mohammed Al-Yakoob,et al.  Mixed-Integer Mathematical Programming Optimization Models and Algorithms For An Oil Tanker Routing and Scheduling Problem , 1997 .

[20]  H. O. Hartley,et al.  Computerized scheduling of seagoing tankers , 1974 .

[21]  Richard F. Hartl,et al.  A survey on pickup and delivery problems , 2008 .

[22]  B. Slack,et al.  The Geography of Transport Systems , 2006 .

[23]  Gilbert Laporte,et al.  Static pickup and delivery problems: a classification scheme and survey , 2007 .

[24]  L. Appelgren.  Integer Programming Methods for a Vessel Scheduling Problem , 1971 .

[25]  K. Lemmens,et al.  To split or not to split: that is the question , 2007 .

[26]  Si Chen,et al.  The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results , 2007, Networks.

[27]  Mikael Rönnqvist,et al.  A hybrid method based on linear programming and tabu search for routing of logging trucks , 2009, Comput. Oper. Res..

[28]  W. M. Bremer,et al.  AN OPERATIONAL TANKER SCHEDULING OPTIMIZATION SYSTEM: MODEL IMPLEMENTATION, RESULTS AND POSSIBLE EXTENSIONS. , 1992 .