Skip to main content

Loading Problem in Multiple Containers and Pallets Using Strategic Search Method

  • Conference paper
Modeling Decisions for Artificial Intelligence (MDAI 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3558))

Abstract

An optimal loading in multiple containers and pallets is considered. In this paper, a strategic search method using meta-heuristics and strategic procedure is proposed. This method gives the loading sequence of packages and selection sequence of containers and pallets to utilize them. The meta-heuristics determines the sequence of packages, and the strategic procedure determines the sequence of containers and pallets with reference to search process. Therefore, this method is realized to find optimal sequences. The effectiveness of the proposed method is compared with other methods, such as local search and simulated annealing. The experimental results show that the present method is superior to other methods.

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 54.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. Bischoff, E.E., Ratcliff, M.S.W.: Loading multiple pallets. JORS 46, 1322–1336 (1995)

    MATH  Google Scholar 

  2. Eley, M.: Solving container loading problems by block arrangement. EJOR 141, 393–402 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  3. George, J.A., Robinson, D.F.: A heuristic for packing boxes into a container. Computers Ops. Res. 7, 147–156 (1980)

    Article  Google Scholar 

  4. Gilmore, P.C., Gomory, R.E.: Multistage cutting stock problems of two and more dimensions. Opns. Res. 13, 94–120 (1965)

    Article  MATH  Google Scholar 

  5. Ivancic, N., Mathur, K., Mohanty, B.B.: An integer-programming based heuristic approach to the three-dimensional packing problem. J. Manuf. Ops. Mgmt. 2, 268–298 (1989)

    MathSciNet  Google Scholar 

  6. Takahara, S., Miyamoto, S.: An adaptive meta-heuristic approach to three-dimensional packing problems. In: Proc. of AFSS 2000, pp. 278–283 (2000)

    Google Scholar 

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

    MATH  Google Scholar 

  8. Terno, J., Scheithauer, G., Sommerweiß, U., Riehme, J.: An efficient approach for the multi-pallet loading problem. EJOR 123, 373–381 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Takahara, S. (2005). Loading Problem in Multiple Containers and Pallets Using Strategic Search Method. In: Torra, V., Narukawa, Y., Miyamoto, S. (eds) Modeling Decisions for Artificial Intelligence. MDAI 2005. Lecture Notes in Computer Science(), vol 3558. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11526018_44

Download citation

  • DOI: https://doi.org/10.1007/11526018_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-27871-9

  • Online ISBN: 978-3-540-31883-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics