Optimizing Liner Shipping Fleet Repositioning Plans

ISBN-13: 9783319368412 / Angielski / Miękka / 2016 / 182 str.

Kevin Tierney

Opis

This monograph addresses several critical problems to the operations of shipping lines and ports, and provides algorithms and mathematical models for use by shipping lines and port authorities for decision support.

Spis treści

Introduction.- Containerized Shipping.- Liner Shipping Fleet Repositioning.- Methodological Background.- Liner Shipping Fleet Repositioning without Cargo.- Liner Shipping Fleet Repositioning with Cargo.- Conclusion.

O autorze

Kevin Tierney is currently an Assistant Professor of "Decision Support Systems and Operations Research" in the department of Business Information Systems at the University of Paderborn in Paderborn, Germany. He earned his PhD from the IT University of Copenhagen in Copenhagen, Denmark in 2013 for his work on optimizing liner shipping fleet repositioning plans as part of the ENERPLAN project. He holds a Sc.M. in Computer Science from Brown University (2010) and a B.S. in Computer Science from the Rochester Institute of Technology (2008).

Kevin Tierney researches the modeling and solution of large scale, real world optimization problems using mixed-integer linear programming, constraint programming and (meta)heuristics. He focuses in particular on problems in the maritime industry, including liner shipping networks and container terminal optimization.

Blurb

This monograph addresses several critical problems to the operations of shipping lines and ports, and provides algorithms and mathematical models for use by shipping lines and port authorities for decision support. One of these problems is the repositioning of container ships in a liner shipping network in order to adjust the network to seasonal shifts in demand or changes in the world economy. We provide the first problem description and mathematical model of repositioning and define the liner shipping fleet repositioning problem (LSFRP). The LSFRP is characterized by chains of interacting activities with a multi-commodity flow over paths defined by the activities chosen. We first model the problem without cargo flows with a variety of well-known optimization techniques, as well as using a novel method called linear temporal optimization planning that combines linear programming with partial-order planning in a branch-and-bound framework. We then model the LSFRP with cargo flows, using several different mathematical models as well as two heuristic approaches. We evaluate our techniques on a real-world dataset that includes a scenario from our industrial collaborator. We show that our approaches scale to the size of problems faced by industry, and are also able to improve the profit on the reference scenario by over US$14 million.