Industrial ship routing problem with split delivery and two types of vessels

A maritime pickup and delivery problem is studied.A mixed integer programming model is developed.An adaptive large neighborhood search based heuristic is proposed.Thirty benchmark problem instances are developed.Computational results show the effectiveness of the proposed algorithm. This paper introduces an industrial ship routing problem (ISRP) of a steel manufacturing company. Given a set of cargoes with pickup, delivery ports, and time windows, the problem determines how to route a fleet of heterogeneous ships to carry the cargoes. The cargoes can be split to be served by multiple ships if their time window is not violated. In addition, a ship can handle multiple cargoes within a route. The fleet of heterogeneous ships consists of two types of ships: company-owned ships and tramp ships. Each of both types consists of heterogeneous ships with different capacities. A company-owned ship can deliver cargoes from multiple supply ports to multiple delivery ports within a route, whereas a tramp ship can deliver a cargo directly from a supply port to a delivery port within a route. To reduce operation cost, the two types of the ships should be well coordinated and utilized. A mixed integer programming model for the problem is presented, and an adaptive large neighborhood search-based heuristic is proposed. Thirty benchmark problems are generated and categorized into three groups according to the number of vessels and cargoes. Computational experiments demonstrate the effectiveness of the proposed algorithm.

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

[2]  Moshe Dror,et al.  Savings by Split Delivery Routing , 1989, Transp. Sci..

[3]  Manish Verma,et al.  A bi-objective approach to routing and scheduling maritime transportation of crude oil , 2015 .

[4]  Qiang Meng,et al.  A tailored branch-and-price approach for a joint tramp ship routing and bunkering problem , 2015 .

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

[6]  Maria Grazia Speranza,et al.  Vehicle routing problems with split deliveries , 2012, Int. Trans. Oper. Res..

[7]  David Pisinger,et al.  A unified heuristic for a large class of Vehicle Routing Problems with Backhauls , 2006, Eur. J. Oper. Res..

[8]  Laurence A. Wolsey,et al.  A maritime inventory routing problem: Discrete time formulations and valid inequalities , 2013, Networks.

[9]  Kjetil Fagerholt,et al.  Ship routing and scheduling in the new millennium , 2013, Eur. J. Oper. Res..

[10]  Gerald G. Brown,et al.  Scheduling short-term marine transport of bulk products , 1998 .

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

[12]  Marielle Christiansen,et al.  A branch-price-and-cut method for a ship routing and scheduling problem with split loads , 2011, Comput. Oper. Res..

[13]  Kjetil Fagerholt,et al.  The Maritime Pickup and Delivery Problem with Time Windows and Split Loads , 2011, INFOR Inf. Syst. Oper. Res..

[14]  Kjetil Fagerholt,et al.  A combined ship scheduling and allocation problem , 2000, J. Oper. Res. Soc..

[15]  Christian Artigues,et al.  Large Neighborhood Search for Variants of TSP , 2007 .

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

[17]  Andrew L. Johnson,et al.  An augmented large neighborhood search method for solving the team orienteering problem , 2013, Expert Syst. Appl..

[18]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[19]  Jongsung Lee,et al.  The nuclear medicine production and delivery problem , 2014, Eur. J. Oper. Res..

[20]  Tatsushi Nishi,et al.  Column generation heuristics for ship routing and scheduling problems in crude oil transportation with split deliveries , 2014, Comput. Chem. Eng..

[21]  Celso C. Ribeiro,et al.  Tutorials in Operations Research , 2012, Int. Trans. Oper. Res..

[22]  Yavuz A. Bozer,et al.  A shortest path approach to the multiple-vehicle routing problem with split pick-ups , 2006 .

[23]  Inge Norstad,et al.  Tramp ship routing and scheduling with speed optimization , 2011 .

[24]  L. Shih.  Planning of fuel coal imports using a mixed integer programming method , 1997 .

[25]  Bjørn Nygreen,et al.  Alternative approaches to the crude oil tanker routing and scheduling problem with split pickup and split delivery , 2015, Eur. J. Oper. Res..

[26]  P. Davis,et al.  A selection framework for infrastructure condition monitoring technologies in water and wastewater networks , 2013, Expert Syst. Appl..

[27]  M. Dror,et al.  Split delivery routing , 1990 .

[28]  Kjetil Fagerholt,et al.  A tabu search heuristic for ship routing and scheduling with flexible cargo quantities , 2010, J. Heuristics.

[29]  D Ronen,et al.  CARGO SHIPS ROUTING AND SCHEDULING: SURVEY OF MODELS AND PROBLEMS. IN: MARITIME TRANSPORT , 1983 .

[30]  Marielle Christiansen,et al.  Hybrid heuristics for a short sea inventory routing problem , 2014, Eur. J. Oper. Res..

[31]  Jean-François Cordeau,et al.  Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows , 2009, Transp. Sci..

[32]  Samuel A. Lawrence.  International sea transport: the years ahead , 1972 .

[33]  Guy Desaulniers,et al.  Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows , 2008, Oper. Res..

[34]  K. Fagerholt,et al.  A travelling salesman problem with allocation, time window and precedence constraints — an application to ship scheduling , 2000 .

[35]  Kevin C. Furman,et al.  A maritime inventory routing problem: Practical approach , 2013, Comput. Oper. Res..

[36]  David Ronen,et al.  Ship scheduling: The last decade , 1993 .

[37]  Naoki Katoh,et al.  An approximation algorithm for the pickup and delivery vehicle routing problem on trees , 2006, Discret. Appl. Math..

[38]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[39]  ChristiansenMarielle,et al.  Ship Routing and Scheduling , 2004 .

[40]  Byung-In Kim,et al.  New best solutions to VRPSPD benchmark problems by a perturbation based algorithm , 2012, Expert Syst. Appl..

[41]  Michel Gendreau,et al.  Vehicle Routing with Time Windows and Split Deliveries , 2003 .

[42]  Kjetil Fagerholt,et al.  A large neighbourhood search heuristic for ship routing and scheduling with split loads , 2010, Comput. Oper. Res..

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

[44]  Marielle Christiansen,et al.  Modelling path flows for a combined ship routingand inventory management problem , 1998, Ann. Oper. Res..

[45]  Dag Haugland,et al.  A tabu search heuristic for the vehicle routing problem with time windows and split deliveries , 2004, Comput. Oper. Res..

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

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

[48]  Guy Desaulniers,et al.  Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows , 2009, Transp. Sci..

[49]  Marielle Christiansen,et al.  A maritime inventory routing problem with stochastic sailing and port times , 2015, Comput. Oper. Res..

[50]  David Pisinger,et al.  Large Neighborhood Search , 2018, Handbook of Metaheuristics.

[51]  Hoong Chuin Lau,et al.  Pickup and Delivery with Time Windows: Algorithms and Test Case Generation , 2002, Int. J. Artif. Intell. Tools.