Skip to main content
SpringerLink
Log in

Heuristics Backtracking and a Typical Genetic Algorithm for the Container Loading Problem with Weight Distribution

  • Conference paper
Information Computing and Applications (ICICA 2010)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 106))

Included in the following conference series:

Abstract

In this study we propose a backtracking heuristic for the solution of the Container Loading Problem with Weight Distribution. The problem consists of maximizing the loaded cargo in a single container without overlapping. Our methodology consists of the application of a backtracking heuristic in order to construct blocks of items with the intent of maximizing the total volume of the packed boxes. So, the approached algorithm uses a typical Genetic Algorithm to maximize the weight distribution of the loaded cargo. We use a well-known benchmark test suite to compare our results with those of other approaches. We also present a case study on real data from ESMALTEC, a stove and refrigerator manufacturer in Brazil. The results of our approach represented a significant improvement over the current practice within ESMALTEC.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Araújo, L.J.P., Pinheiro, P.C.: Combining Heuristics Backtracking and Genetic Algorithm to Solve the Container Loading Problem with Weight Distribution, vol. (73), pp. 95–102. Springer, Heidelberg (2010)

    Google Scholar 

  2. Beasley, J.E.: OR-Library: distributing test problems by electronic mail. Journal of the Operational Research Society 41(11), 1069–1072 (1990)

    Article  Google Scholar 

  3. Bischoff, E.E.: Three dimensional packing of items with limited load bearing strength. European Journal of Operational Research 168, 952–966 (2006)

    Article  MATH  Google Scholar 

  4. Bischoff, E.E., Janetz, F., Ratcliff, M.S.W.: Loading Pallets with Nonidentical Items. European Journal of Operational Research 84, 681–692 (1995)

    Article  MATH  Google Scholar 

  5. Bischoff, E.E., Ratcliff, M.S.W.: Issues in the Development of Approaches to Container Loading. Omega 23, 377–390 (1995)

    Article  Google Scholar 

  6. Bortfeldt, A., Gehring, H.: A Hybrid Genetic Algorithm for the Container Loading Problem. European Journal of Operational Research 131, 143–161 (2001)

    Article  MATH  Google Scholar 

  7. Bortfeldt, A., Gehring, H., Mack, D.: A Parallel Tabu Search Algorithm for Solving the Container Loading Problem. Parallel Computing 29, 641–662 (2002)

    Article  Google Scholar 

  8. Chen, C.S., Lee, S.M., Shen, Q.S.: An analytical model for the container loading problem. European Journal of Operations Research 80, 6876 (1993)

    Google Scholar 

  9. Davies, A.P., Bischoff, E.E.: Weight distribution considerations in container loading. European Journal of Operations Research 114, 509–527 (1999)

    Article  MATH  Google Scholar 

  10. Dyckhoff, H.: A typology of cutting and packing problems. European Journal of Operational Research 44, 145–159 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  11. Gehring, H., Bortfeldt, A.: A Genetic Algorithm for Solving the Container Loading Problem. Internat. Trans. Operational Research 4, 401–418 (1997)

    MATH  Google Scholar 

  12. Gehring, H., Bortfeldt, A.: A Parallel Genetic Algorithm for Solving the Container Loading Problem. International Transactions in Operational Research 9, 497–511 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  13. Gehring, H., Menschner, K., Meyer, M.: A computer-based heuristic for packing pooled shipment containers. European Journal of Operational Research 44, 277–288 (1990)

    Article  MATH  Google Scholar 

  14. George, J.A., Robinson, D.F.: A heuristic for packing boxes into a container. Computers and Operations Research 7, 147–156 (1980)

    Article  Google Scholar 

  15. Mack, D., Bortfeldt, A., Gehring, H.: A parallel hybrid local search algorihtm for the container loading problem. International Transactions in Operations Research 11, 511–533 (2004)

    Article  MATH  Google Scholar 

  16. Martello, S., Pisinger, D., Vigo, D.: The three-dimensional bin packing problem. Operational Research 48, 256–267 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  17. Morabito, R., Arenales, M.: An and/or-graph approach to the container loading problem. International Transactions in Operational Research 1(1), 59–73 (1994)

    Article  MATH  Google Scholar 

  18. Nepomuceno, N., Pinheiro, P.R., Coelho, A.L.V.: Tackling the Container Loading Problem: A Hybrid Approach Based on Integer Linear Programming and Genetic Algorithms. In: Cotta, C., van Hemert, J. (eds.) EvoCOP 2007. LNCS, vol. 4446, pp. 154–165. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  19. Pisinger, D.: Heuristc for the Conteiner Loading Problem. European Journal of Operational Research 141, 382–392 (2000)

    Article  MathSciNet  Google Scholar 

  20. Pisinger, D.: Heuristics for the Container Loading Problem. European Journal of Operational Research 141, 143–153 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  21. Wascher, G., Hausner, H., Schumann, H.: An improved typology of cutting and packing problems. European Journal of Operational Research 183(3), 1109–1130 (2007)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Applied Informatics, University of Fortaleza (UNIFOR), Av. Washington Soares, 1321 - J30, 60.811-905, Fortaleza, Brazil

    Luiz Jonatã Pires de Araújo & Plácido Rogério Pinheiro

Authors
  1. Luiz Jonatã Pires de Araújo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Plácido Rogério Pinheiro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Computer Science, South-Central University for Nationalities, 708 Minyuan Road, 430074, Wuhan, China

    Rongbo Zhu

  2. 8001, Melbourne, VIC, Australia

    Yanchun Zhang

  3. College of sciences, He’Bei polytechnic University, 063000, Tangshan, Hebei, China

    Baoxiang Liu  & Chunfeng Liu  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pires de Araújo, L.J., Pinheiro, P.R. (2010). Heuristics Backtracking and a Typical Genetic Algorithm for the Container Loading Problem with Weight Distribution. In: Zhu, R., Zhang, Y., Liu, B., Liu, C. (eds) Information Computing and Applications. ICICA 2010. Communications in Computer and Information Science, vol 106. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16339-5_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16339-5_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16338-8

  • Online ISBN: 978-3-642-16339-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation