Skip to main content
SpringerLink
Log in

Container loading for nonorthogonal objects: an approximation using local search and simulated annealing

  • Focus
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Container loading problems consist of finding an appropriate way to load objects into a container. A few alternative algorithms have been defined based on different optimization approaches. Different algorithms also depend on the types of objects considered. In most of the cases, however, the shape of the objects is restricted to be orthogonal (i.e., standard boxes). In this paper, we consider the case where the shape of the objects can be any polyhedron. We propose an algorithm using local search and simulated annealing, and we show that for standard boxes, it has a similar performance than previously established methods.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  • Berthold M, Hand DJ (2003) Intelligent data analysis. Springer, Berlin. ISBN 978-3-540-43060-5, pp 351–401

  • Birgin EG, Martínez JM, Ronconi DP (2005) Optimizing the packing of cylinders into a rectangular container: a nonlinear approach. Eur J Oper Res 160:19–33

    Article  MATH  Google Scholar 

  • Bischoff EE (2006) Three-dimensional packing of items with limited load bearing strength. Eur J Oper Res 168:952–966

    Article  MATH  Google Scholar 

  • Bischoff EE, Ratcliff MSW (1995) Issues in the development of approaches to container loading. Omega Int J Manag Sci 23(4):377–390

    Article  Google Scholar 

  • Bortfeldt A, Gehring H (2001) A hybrid genetic algorithm for the container loading problem. Eur J Oper Res 131:143–161

    Article  MATH  Google Scholar 

  • Bortfeldt A, Gehring H, Mack D (2003) A parallel tabu search algorithm for solving the container loading problem. Parallel Comput 29:641–662

    Article  Google Scholar 

  • Davies AP, Bischoff EE (1999) Weight distribution considerations in container loading. Eur J Oper Res 114:509–527

    Article  MATH  Google Scholar 

  • Dyckhoff H (1990) A typology of cutting and packing problems. Eur J Oper Res 44:145–159

    Article  MATH  MathSciNet  Google Scholar 

  • Dyckhoff H, Finke U (1992) Cutting and packing in production and distribution, Physica, Heidelberg

  • Eley M (2002) Solving container loading problems by block arrangement. Eur J Oper Res 141:393–409

    Article  MATH  MathSciNet  Google Scholar 

  • Eley M (2003) A bottleneck assignment approach to the multiple container loading problem. OR Spectrum 25:45–60

    Article  MATH  MathSciNet  Google Scholar 

  • Gehring H, Bortfeldt A (1997) A genetic algorithm for solving the container loading problem. Int Trans Oper Res 4(5/6)401–418

    Google Scholar 

  • Gendreau M, Iori M, Laporte G, Martello S (2006) A Tabu search algorithm for a routing and container loading problem. Transp Sci 40(3):342–350

    Article  Google Scholar 

  • George JA, George JM, Lamar BW (1995) Packing different-sized circles into a rectangular container. Eur J Oper Res 84:693–712

    Article  MATH  Google Scholar 

  • Iori M, Salazar-Gonzalez J-J, Vigo D (2007) An exact approach for the vehicle routing problem with two-dimensional loading constraints. Transp Sci 41(2):253–264

    Article  Google Scholar 

  • Miyamoto S, Endo Y, Hanzawa K, Hamasuna Y (2006) Metaheuristic algorithms for container loading problems: framework and knowledge utilization. J Adv Intell Intell Inform 11(5):51–60

    Google Scholar 

  • Narasimhan A, Palekar US (2002) Analysis and algorithms for the transtainer routing problem in container port operations. Transp Sci 36(1):63–78

    Article  MATH  Google Scholar 

  • Pisinger D (2002) Heuristics for the container loading problem. Eur J Oper Res 141:382–392

    Article  MATH  MathSciNet  Google Scholar 

  • Takahara S, Kusumoto Y, Miyamoto S (2003) Solution for textile nesting problems using adaptive meta-heuristics and grouping. Soft Comput 7:154–159

    MATH  Google Scholar 

  • Zachmann G (2000) Virtual reality in assembly simulation collision detection, simulation algorithms, and interaction techniques. PhD Dissertation, Technischen Universität Darmstadt

  • Zachmann G (1994) Exact and fast collision detection. Diploma Thesis, Technischen Universität Darmstadt

Download references

Acknowledgments

This work is partially supported by the Spanish Ministerio de Fomento (project PON, T27/2006) and MEC (projects CONSOLIDER INGENIO 2010 CSD2007-00004, and TSI2007-65406-C03-02) and by the Generalitat de Catalunya (AGAUR, 2006BE-2 00338).

Author information

Authors and Affiliations

  1. IIIA, Artificial Intelligence Research Institute, CSIC, Spanish National Research Council, Campus UAB, 08193, Bellaterra, Catalonia, Spain

    Vicenç Torra & Isaac Cano

  2. Department of Risk Engineering, School of Systems and Information Engineering, University of Tsukuba, Ibaraki, 305-8573, Japan

    Sadaaki Miyamoto & Yasunori Endo

Authors
  1. Vicenç Torra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Isaac Cano
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sadaaki Miyamoto
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yasunori Endo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vicenç Torra.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Torra, V., Cano, I., Miyamoto, S. et al. Container loading for nonorthogonal objects: an approximation using local search and simulated annealing. Soft Comput 14, 537–544 (2010). https://doi.org/10.1007/s00500-009-0445-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-009-0445-x

Keywords

Search

Navigation