IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v53y2002i4d10.1057_palgrave.jors.2601322.html
   My bibliography  Save this article

Stowage planning in maritime container transportation

Author

Listed:
  • J-G Kang

    (Swiss Federal Institute of Technology-Lausanne (EPFL))

  • Y-D Kim

    (Korea Advanced Institute of Science and Technology)

Abstract

We consider a stowage-planning problem of arranging containers on a container ship in the maritime transportation system. Since containers are accessible only from the top of the stack, temporary unloading and reloading of containers, called shifting, is unavoidable if a container required to be unloaded at the current port is stacked under containers to be unloaded at later ports on the route of the ship. The objective of the stowage planning problem is to minimize the time required for shifting and crane movements on a tour of a container ship while maintaining the stability of the ship. For the problem, we develop a heuristic solution method in which the problem is divided into two subproblems, one for assigning container groups into the holds and one for determining a loading pattern of containers assigned to each hold. The former subproblem is solved by a greedy heuristic based on the transportation simplex method, while the latter is solved by a tree search method. These two subproblems are solved iteratively using information obtained from solutions of each other. To see the performance of the suggested algorithm, computational tests are performed on problem instances generated based on information obtained from an ocean container liner. Results show that the suggested algorithm works better than existing algorithms.

Suggested Citation

  • J-G Kang & Y-D Kim, 2002. "Stowage planning in maritime container transportation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(4), pages 415-426, April.
  • Handle: RePEc:pal:jorsoc:v:53:y:2002:i:4:d:10.1057_palgrave.jors.2601322
    DOI: 10.1057/palgrave.jors.2601322
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601322
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1057/palgrave.jors.2601322?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Monaco, Maria Flavia & Sammarra, Marcello & Sorrentino, Gregorio, 2014. "The Terminal-Oriented Ship Stowage Planning Problem," European Journal of Operational Research, Elsevier, vol. 239(1), pages 256-265.
    2. Christensen, Jonas & Pacino, Dario, 2017. "A matheuristic for the Cargo Mix Problem with Block Stowage," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 97(C), pages 151-171.
    3. Michael F. Gorman & John-Paul Clarke & Amir Hossein Gharehgozli & Michael Hewitt & René de Koster & Debjit Roy, 2014. "State of the Practice: A Review of the Application of OR/MS in Freight Transportation," Interfaces, INFORMS, vol. 44(6), pages 535-554, December.
    4. Petri Helo & Henri Paukku & Tero Sairanen, 2021. "Containership cargo profiles, cargo systems, and stowage capacity: key performance indicators," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 23(1), pages 28-48, March.
    5. Delgado, Alberto & Jensen, Rune Møller & Janstrup, Kira & Rose, Trine Høyer & Andersen, Kent Høj, 2012. "A Constraint Programming model for fast optimal stowage of container vessel bays," European Journal of Operational Research, Elsevier, vol. 220(1), pages 251-261.
    6. Ding, Ding & Chou, Mabel C., 2015. "Stowage planning for container ships: A heuristic algorithm to reduce the number of shifts," European Journal of Operational Research, Elsevier, vol. 246(1), pages 242-249.
    7. Parreño, Francisco & Pacino, Dario & Alvarez-Valdes, Ramon, 2016. "A GRASP algorithm for the container stowage slot planning problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 94(C), pages 141-157.
    8. Christensen, Jonas & Erera, Alan & Pacino, Dario, 2019. "A rolling horizon heuristic for the stochastic cargo mix problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 123(C), pages 200-220.
    9. Rune Larsen & Dario Pacino, 2021. "A heuristic and a benchmark for the stowage planning problem," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 23(1), pages 94-122, March.
    10. Wu, Yue & Luo, Jiabin & Zhang, Dali & Dong, Ming, 2013. "An integrated programming model for storage management and vehicle scheduling at container terminals," Research in Transportation Economics, Elsevier, vol. 42(1), pages 13-27.
    11. Goerigk, Marc & Knust, Sigrid & Le, Xuan Thanh, 2016. "Robust storage loading problems with stacking and payload constraints," European Journal of Operational Research, Elsevier, vol. 253(1), pages 51-67.
    12. Christos A. Kontovas & Krishna Sooprayen, 2020. "Maritime Cargo Prioritisation during a Prolonged Pandemic Lockdown Using an Integrated TOPSIS-Knapsack Technique: A Case Study on Small Island Developing States—The Rodrigues Island," Sustainability, MDPI, vol. 12(19), pages 1-20, September.
    13. Gilbert Laporte, 2010. "Comments on: Routing problems with loading constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 18(1), pages 28-30, July.
    14. R. Roberti & D. Pacino, 2018. "A Decomposition Method for Finding Optimal Container Stowage Plans," Service Science, INFORMS, vol. 52(6), pages 1444-1462, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pal:jorsoc:v:53:y:2002:i:4:d:10.1057_palgrave.jors.2601322. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.