Soft Computing

, Volume 21, Issue 7, pp 1753–1763 | Cite as

Computational evaluation of a MIP model for multi-port stowage planning problems

  • Daniela Ambrosino
  • Massimo Paolucci
  • Anna Sciomachen
Methodologies and Application

Abstract

In this paper, we consider the problem of determining stowage plans for containers into ships having to visit a given number of ports in their circular route. The problem is denoted Multi-Port Master Bay Plan Problem (MP-MBPP). In practice, the MP-MBPP consists in determining how to stow a given set of containers, split into different groups, according to their size, type, class of weight and destination, into bay locations, either on the deck or in the stow. Some structural and operational constraints, related to the containers, the ship and the maritime terminals, have to be satisfied. The single port MBPP is a NP-hard optimization problem, and has been proposed in the literature from 2001. From then, some variants of the problem have been presented, together with the related solution methods, mainly aimed at including in the corresponding models realistic features, required as a consequence of the naval gigantism. As a novel issue, in the present work, we look for stowage plans where the set of containers to be loaded on board at each port of the route consists of standard, reefer and open top ones. Hatches positions in the ships are considered too. We present a new mixed integer programming (MIP) model for the MP-MBPP able to manage realistic scenarios and find stowage plans for containerships up to 18,000 TEUs. The model is finalized to be solved with a commercial MIP solver. The reported computational experimentation shows that the model is very efficient and could be fruitfully used for facing real-size instances of the problem.

Keywords

Stowage plans Combinatorial optimization problem Mixed integer linear programming model Computational evaluation 

References

  1. Ambrosino D, Sciomachen A, Tanfani E (2004) Stowing a containership: the Master Bay Plan problem. Transp Res A 38:81–99CrossRefGoogle Scholar
  2. Ambrosino D, Anghinolfi D, Paolucci D, Sciomachen A (2010) An experimental comparison of different metaheuristics for the Master Bay Plan Problem. In: Festa P (ed) Experimental algorithms, Lecture notes in computer science. Springer, Berlin, pp 314–325Google Scholar
  3. Ambrosino D, Paolucci M, Sciomachen A (2013) Experimental evaluation of mixed integer programming models for the multi-port master bay plan problem. Flex Serv Manuf 27:263–284Google Scholar
  4. Ambrosino D, Sciomachen A (2015) Using a bin packing approach for stowing hazardous containers into containerships. In: Pinter JD, Fasano G (eds) Optimized packings and their applications. Springer, New YorkGoogle Scholar
  5. Avriel M, Penn M, Shpirer N (2000) Container ship stowage problem: complexity and connection to the colouring of circle graphs. Discrete Appl Math 103:271–279MathSciNetCrossRefMATHGoogle Scholar
  6. Delgado A, Jensen RM, Janstrup K, Rose TH, Andersen KH (2012) A constraint programming model for fast optimal stowage of container vessel bays. Eur J Oper Res 220(1):251–261MathSciNetCrossRefMATHGoogle Scholar
  7. Imai A, Nishimura E, Papadimitriu S, Sasaki K (2002) The containership loading problem. Int J Marit Econ 4:126–148CrossRefGoogle Scholar
  8. Imai A, Sasaki K, Nishimura E, Papadimitriou S (2006) Multi-objective simultaneous stowage and load planning for a container ship with container rehandles in yard stacks. Eur J Oper Res 171:373–389CrossRefMATHGoogle Scholar
  9. Kang JG, Kim YD (2002) Stowage planning in maritime container transportation. J Oper Res Soc 53(4):415–426CrossRefMATHGoogle Scholar
  10. Li F, Tian C, Cao R, Ding W (2008) An integer linear programming for container stowage problem. In: Bubak M, van Albada G, Dongarra J (eds) Sloot computational science ICCS 2008, Lecture notes in computer science. Springer, Heidelberg, pp 853–862Google Scholar
  11. Monaco MF, Sammarra M, Sorrentino G (2014) The terminal-oriented ship stowage planning problem. Eur J Oper Res 239:256–265CrossRefMATHGoogle Scholar
  12. Pacino D, Delgado A, Jensen RM, Bebbington T (2011) Fast generationof near-optimal plans for eco—efficient stowage of large containervessels. In: Bse J, Hu H, Jahn C, Shi X, Stahlbock R, Voss S (eds) Computational logistics, Lecture notes in computer science. Springer, Heidelberg, pp 286–301Google Scholar
  13. Pacino D, Delgado A, Jensen RM, Bebbington T (2012) An accurate model for seaworthy container vessel stowage planning with ballast tanks. In: Proceedings of the third international conference on computational logisticsGoogle Scholar
  14. Rashidi H (2013) Tsang EPK, novel constraints satisfaction models for optimization problems in container terminals. Appl Math Model 37:3601–3634CrossRefGoogle Scholar
  15. Stahlbock R, Voss S (2008) Operations research at container terminal: a literature update. OR Spect 30:1–52MathSciNetCrossRefMATHGoogle Scholar
  16. Steenken D, Voss S, Stahlbock R (2004) Container terminal operation and operations research—a classification and literature review. OR Spect 26:3–49CrossRefMATHGoogle Scholar
  17. Wilson D, Roach PA, Ware JA (2001) Container stowage pre-planning: using search to generate solutions, a case study. Knowl-Based Syst 14(3–4):137–145CrossRefGoogle Scholar
  18. Wilson ID, Roach PA (2000) Container stowage planning: a methodology for generating computerised solutions. J Oper Res Soc 51(11):1248–1255CrossRefMATHGoogle Scholar
  19. Zhang W-Y, Lin Y, Zhou-shang JI (2005) Model and algorithm for container ship stowage planning based on bin packing problem. J Mar Sci Appl 4(3):30–36CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  • Daniela Ambrosino
    • 1
  • Massimo Paolucci
    • 2
  • Anna Sciomachen
    • 1
  1. 1.Department of Economics and Business Studies (DIEC)University of GenovaGenovaItaly
  2. 2.Department of Informatics, Bioengineering, Robotics and Systems Engineering (DIBRIS)University of GenovaGenovaItaly

Personalised recommendations