A Decomposed Fourier-Motzkin Elimination Framework to Derive Capacity Models of Container Vessels

Accurate capacity models expressing the trade-off between different container types that can be stowed on container vessels are required in core liner shipping functions such as uptake, capacity, and network management. Today, simple models based on volume, weight, and refrigerated container capacity are used for these tasks, which causes overestimations that hamper decision making. Though previous work on stowage planning optimization in principle provide fine-grained linear Vessel Stowage Models (VSMs), they are too complex to be used in the mentioned functions. As an alternative, this paper contributes a novel framework based on Fourier-Motzkin elimination that automatically derives Vessel Capacity Models (VCMs) from VSMs by projecting unneeded variables. Our results show that the projected VCMs are reduced by an order of magnitude and can be solved 20-35 times faster than their corresponding VSMs with only a negligible loss in accuracy. Our framework is applicable to LP models in general, but are particularly effective on block-angular structured problems such as VSMs. We show similar results for a multi-commodity flow problem.

[1]  R. Duffin On fourier’s analysis of linear inequality systems , 1974 .

[2]  Jean-Louis Lassez,et al.  Querying constraints , 1990, PODS '90.

[3]  Warren B. Powell,et al.  Multicommodity network flows: The impact of formulation on decomposition , 1993, Math. Program..

[4]  G. Ziegler Lectures on Polytopes , 1994 .

[5]  Erling D. Andersen,et al.  Presolving in linear programming , 1995, Math. Program..

[6]  I. D. Wilson,et al.  Container stowage planning: a methodology for generating computerised solutions , 2000, J. Oper. Res. Soc..

[7]  J.-G. Kang,et al.  Stowage planning in maritime container transportation , 2002, J. Oper. Res. Soc..

[8]  J. Maciejowski,et al.  Equality Set Projection: A new algorithm for the projection of polytopes in halfspace representation , 2004 .

[9]  Anna Sciomachen,et al.  Stowing a containership: the master bay plan problem , 2004 .

[10]  Andy King,et al.  Exploiting Sparsity in Polyhedral Analysis , 2005, SAS.

[11]  Jean-Louis Lassez,et al.  Practical issues on the projection of polyhedral sets , 2005, Annals of Mathematics and Artificial Intelligence.

[12]  Frédéric Mesnard,et al.  Computing convex hulls with a linear solver , 2003, Theory and Practice of Logic Programming.

[13]  A constructive algorithm for folding large-scale systems of linear inequalities , 2008 .

[14]  David Monniaux,et al.  Quantifier Elimination by Lazy Model Enumeration , 2010, CAV.

[15]  Alberto Delgado,et al.  Fast Generation of Near-Optimal Plans for Eco-Efficient Stowage of Large Container Vessels , 2011, ICCL.

[16]  Alberto Delgado,et al.  An Accurate Model for Seaworthy Container Vessel Stowage Planning with Ballast Tanks , 2012, ICCL.

[17]  D. V. Shapot,et al.  Solution Building for Arbitrary System of Linear Inequalities in an Explicit Form , 2012 .

[18]  R. M. Jensen,et al.  Using Fourier-Motzkin-Elimination to Derive Capacity Models of Container Vessels , 2017 .

[19]  Vitor Nazário Coelho,et al.  Container Vessel Stowage Planning System Using Genetic Algorithm , 2017, EvoApplications.

[20]  Rune Møller Jensen,et al.  The Standard Capacity Model: Towards a Polyhedron Representation of Container Vessel Capacity , 2018, ICCL.