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

A heuristic for sea-freight container selection, cargo allocation and cargo orientation

Author

Listed:
  • T N Wong

    (University of Hong Kong)

  • P S Chow

    (University of Hong Kong)

  • D Sculli

    (University of Hong Kong)

Abstract

A model is proposed to generate solutions for container selection, for the allocation of cargo to containers, and for cargo orientation within a container. The model is in the form of a mixed integer program with the objective of minimizing the total shipping cost. The practical requirements of loading priority and weight distribution along the main dimension of the container are incorporated into the model. A heuristic solution strategy is proposed and used to control the computation time by pre-setting the search increments. Three case examples are presented. The first and third examples show that the proposed model can produce a better solution than the manual schedulers. The second example is taken from the literature and is compared with the solution generated by the proposed model, demonstrating that the practical considerations incorporated into the model do not necessarily lead to increased shipping costs.

Suggested Citation

  • T N Wong & P S Chow & D Sculli, 2006. "A heuristic for sea-freight container selection, cargo allocation and cargo orientation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(12), pages 1452-1463, December.
    • Handle: RePEc:pal:jorsoc:v:57:y:2006:i:12:d:10.1057_palgrave.jors.2602116
    DOI: 10.1057/palgrave.jors.2602116
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2602116
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2602116?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.

    References listed on IDEAS

    as
    1. Pisinger, David, 2002. "Heuristics for the container loading problem," European Journal of Operational Research, Elsevier, vol. 141(2), pages 382-392, September.
    2. Bischoff, Eberhard E. & Marriott, Michael D., 1990. "A comparative evaluation of heuristics for container loading," European Journal of Operational Research, Elsevier, vol. 44(2), pages 267-276, January.
    3. Eley, Michael, 2002. "Solving container loading problems by block arrangement," European Journal of Operational Research, Elsevier, vol. 141(2), pages 393-409, September.
    4. Bischoff, E. E. & Ratcliff, M. S. W., 1995. "Issues in the development of approaches to container loading," Omega, Elsevier, vol. 23(4), pages 377-390, August.
    5. Birgin, E. G. & Martinez, J. M. & Ronconi, D. P., 2005. "Optimizing the packing of cylinders into a rectangular container: A nonlinear approach," European Journal of Operational Research, Elsevier, vol. 160(1), pages 19-33, January.
    6. Terno, Johannes & Scheithauer, Guntram & Sommerwei[ss], Uta & Riehme, Jan, 2000. "An efficient approach for the multi-pallet loading problem," European Journal of Operational Research, Elsevier, vol. 123(2), pages 372-381, June.
    7. Chen, C. S. & Lee, S. M. & Shen, Q. S., 1995. "An analytical model for the container loading problem," European Journal of Operational Research, Elsevier, vol. 80(1), pages 68-76, January.
    8. Davies, A. Paul & Bischoff, Eberhard E., 1999. "Weight distribution considerations in container loading," European Journal of Operational Research, Elsevier, vol. 114(3), pages 509-527, May.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. McDonald, Conor M., 2016. "Integrating packaging and supply chain decisions: Selection of economic handling unit quantities," International Journal of Production Economics, Elsevier, vol. 180(C), pages 208-221.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Bortfeldt, Andreas & Wäscher, Gerhard, 2013. "Constraints in container loading – A state-of-the-art review," European Journal of Operational Research, Elsevier, vol. 229(1), pages 1-20.
    2. Lim, Andrew & Ma, Hong & Qiu, Chaoyang & Zhu, Wenbin, 2013. "The single container loading problem with axle weight constraints," International Journal of Production Economics, Elsevier, vol. 144(1), pages 358-369.
    3. Bischoff, E.E., 2006. "Three-dimensional packing of items with limited load bearing strength," European Journal of Operational Research, Elsevier, vol. 168(3), pages 952-966, February.
    4. Sheng, Liu & Hongxia, Zhao & Xisong, Dong & Changjian, Cheng, 2016. "A heuristic algorithm for container loading of pallets with infill boxes," European Journal of Operational Research, Elsevier, vol. 252(3), pages 728-736.
    5. Carlos A. Vega-Mejía & Jairo R. Montoya-Torres & Sardar M. N. Islam, 2019. "Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review," Annals of Operations Research, Springer, vol. 273(1), pages 311-375, February.
    6. Ramos, António G. & Silva, Elsa & Oliveira, José F., 2018. "A new load balance methodology for container loading problem in road transportation," European Journal of Operational Research, Elsevier, vol. 266(3), pages 1140-1152.
    7. Zhu, Wenbin & Lim, Andrew, 2012. "A new iterative-doubling Greedy–Lookahead algorithm for the single container loading problem," European Journal of Operational Research, Elsevier, vol. 222(3), pages 408-417.
    8. Wang, Ning & Lim, Andrew & Zhu, Wenbin, 2013. "A multi-round partial beam search approach for the single container loading problem with shipment priority," International Journal of Production Economics, Elsevier, vol. 145(2), pages 531-540.
    9. Araya, Ignacio & Moyano, Mauricio & Sanchez, Cristobal, 2020. "A beam search algorithm for the biobjective container loading problem," European Journal of Operational Research, Elsevier, vol. 286(2), pages 417-431.
    10. Wang, Zhoujing & Li, Kevin W. & Levy, Jason K., 2008. "A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach," European Journal of Operational Research, Elsevier, vol. 191(1), pages 86-99, November.
    11. Wascher, Gerhard & Hau[ss]ner, Heike & Schumann, Holger, 2007. "An improved typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1109-1130, December.
    12. Bonet Filella, Guillem & Trivella, Alessio & Corman, Francesco, 2023. "Modeling soft unloading constraints in the multi-drop container loading problem," European Journal of Operational Research, Elsevier, vol. 308(1), pages 336-352.
    13. F. Parreño & R. Alvarez-Valdes & J. M. Tamarit & J. F. Oliveira, 2008. "A Maximal-Space Algorithm for the Container Loading Problem," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 412-422, August.
    14. Thapatsuwan, Peeraya & Pongcharoen, Pupong & Hicks, Chris & Chainate, Warattapop, 2012. "Development of a stochastic optimisation tool for solving the multiple container packing problems," International Journal of Production Economics, Elsevier, vol. 140(2), pages 737-748.
    15. Tian, Tian & Zhu, Wenbin & Lim, Andrew & Wei, Lijun, 2016. "The multiple container loading problem with preference," European Journal of Operational Research, Elsevier, vol. 248(1), pages 84-94.
    16. Ren, Jidong & Tian, Yajie & Sawaragi, Tetsuo, 2011. "A tree search method for the container loading problem with shipment priority," European Journal of Operational Research, Elsevier, vol. 214(3), pages 526-535, November.
    17. Leonardo Junqueira & Reinaldo Morabito & Denise Sato Yamashita, 2012. "MIP-based approaches for the container loading problem with multi-drop constraints," Annals of Operations Research, Springer, vol. 199(1), pages 51-75, October.
    18. Ambrosino, Daniela & Sciomachen, Anna & Tanfani, Elena, 2004. "Stowing a containership: the master bay plan problem," Transportation Research Part A: Policy and Practice, Elsevier, vol. 38(2), pages 81-99, February.
    19. Andreas Bortfeldt & Gerhard Wäscher, 2012. "Container Loading Problems - A State-of-the-Art Review," FEMM Working Papers 120007, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    20. Wei, Lijun & Oon, Wee-Chong & Zhu, Wenbin & Lim, Andrew, 2012. "A reference length approach for the 3D strip packing problem," European Journal of Operational Research, Elsevier, vol. 220(1), pages 37-47.

    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:57:y:2006:i:12:d:10.1057_palgrave.jors.2602116. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.