Skip to main content

An LNS Approach for Container Stowage Multi-port Master Planning

  • Conference paper
Computational Logistics (ICCL 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8197))

Included in the following conference series:

Abstract

The generation of competitive stowage plans have become a priority for the shipping industry. Stowage planning is NP-hard and is a challenging optimization problem in practice. Two-phase decomposition approaches have proved to give viable solutions. We propose a large neighborhood search (LNS) to solve the first of the two phases, the multi-port master planning problem. Our approach combines the strength of mathematical modeling with the flexibility of a local search. We show how the new approach can solve more instances than previous mathematical models, and present an analysis of its performance.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 49.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ambrosino, D., Anghinolfi, D., Paolucci, M., Sciomachen, A.: An experimental comparison of different heuristics for the master bay plan problem. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 314–325. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  2. Ambrosino, D., Sciomachen, A.: A constraint satisfaction approach for master bay plans. In: International Conference on Maritime Engineering and Ports, vol. 5, pp. 175–184 (1998)

    Google Scholar 

  3. Ambrosino, D., Sciomachen, A.: Impact of yard organization on the master bay planning problem. Maritime Economics and Logistics 5, 285–300 (2003)

    Article  Google Scholar 

  4. Avriel, M., Penn, M., Shpirer, N., Witteboon, S.: Stowage planning for container ships to reduce the number of shifts. Annals of Oper. Research 76, 55–71 (1998)

    Article  MATH  Google Scholar 

  5. Davidor, Y., Avihail, M.: A method for determining a vessel stowage plan, Patent Publication WO9735266 (1996)

    Google Scholar 

  6. Delgado, A., Jensen, R.M., Schulte, C.: Generating optimal stowage plans for container vessel bays. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 6–20. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  7. Dubrovsky, O., Penn, G.L.M.: A genetic algorithm with a compact solution encoding for the container ship stowage problem. J. of Heuristics 8, 585–599 (2002)

    Article  Google Scholar 

  8. Flor, M.: Heuristic Algorithms for Solving the Container Ship Stowage Problem. Master’s thesis, Technion, Haifa, Isreal (1998)

    Google Scholar 

  9. Giemesch, P., Jellinghaus, A.: Optimization models for the containership stowage problem. In: Proceedings of the Int. Conference of the German Operations Research Society (2003)

    Google Scholar 

  10. Kang, J., Kim, Y.: Stowage planning in maritime container transportation. Journal of the Operational Research Society 53(4), 415–426 (2002)

    Article  MATH  Google Scholar 

  11. Li, F., Tian, C.H., Cao, R., Ding, W.: An integer programming for container stowage problem. In: Bubak, M., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2008, Part I. LNCS, vol. 5101, pp. 853–862. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  12. Pacino, D., Jensen, R.M.: A local search extended placement heuristic for stowing under deck bays of container vessels. In: The 4th Int. Workshop on Freight Transportation and Logistics, ODYSSEUS 2009 (2009)

    Google Scholar 

  13. Pacino, D., Delgado, A., Jensen, R., Bebbington, T.: Fast generation of near-optimal plans for eco-efficient stowage of large container vessels. In: Böse, J.W., Hu, H., Jahn, C., Shi, X., Stahlbock, R., Voß, S. (eds.) ICCL 2011. LNCS, vol. 6971, pp. 286–301. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  14. Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417–431. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  15. Tupper, E.C.: Introdution to Naval Architecture. Elsevier (2009)

    Google Scholar 

  16. Webster, W.C., Van Dyke, P.: Container loading. A container allocation model: I - introduction background, II - strategy, conclusions. In: Proceedings of Computer-Aided Ship Design Engineering Summer Conference. University of Michigan (1970)

    Google Scholar 

  17. Wilson, I.D., Roach, P.: Principles of combinatorial optimization applied to container-ship stowage planning. Journal of Heuristics (5), 403–418 (1999)

    Google Scholar 

  18. Yoke, M., Low, H., Xiao, X., Liu, F., Huang, S.Y., Hsu, W.J., Li, Z.: An automated stowage planning system for large containerships. In: Proceedings of the 4th Virtual Int. Conference on Intelligent Production Machines and Systems (2009)

    Google Scholar 

  19. Zhang, W.Y., Lin, Y., Ji, Z.S.: Model and algorithm for container ship stowage planning based on bin-packing problem. Journal of Marine Science and Application 4(3) (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pacino, D. (2013). An LNS Approach for Container Stowage Multi-port Master Planning. In: Pacino, D., Voß, S., Jensen, R.M. (eds) Computational Logistics. ICCL 2013. Lecture Notes in Computer Science, vol 8197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41019-2_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-41019-2_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-41018-5

  • Online ISBN: 978-3-642-41019-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics