Skip to main content
Springer Nature Link
Log in

Two Natural Heuristics for 3D Packing with Practical Loading Constraints

  • Conference paper
PRICAI 2010: Trends in Artificial Intelligence (PRICAI 2010)

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

Included in the following conference series:

  • 1881 Accesses

Abstract

In this paper, we describe two heuristics for the Single Vehicle Loading Problem (SVLP), which can handle practical constraints that are frequently encountered in the freight transportation industry, such as the servicing order of clients; item fragility; and the stability of the goods. The two heuristics, Deepest-Bottom-Left-Fill and Maximum Touching Area, are 3D extensions of natural heuristics that have previously only been applied to 2D packing problems. We employ these heuristics as part of a two-phase tabu search algorithm for the Three-Dimensional Loading Capacitated Vehicle Routing Problem (3L-CVRP), where the task is to serve all customers using a homogeneous fleet of vehicles at minimum traveling cost. The resultant algorithm produces mostly superior solutions to existing approaches, and appears to scale better with problem size.

This research is partially supported by Niche Area Grant J-BB7C of the Hong Kong Polytechnic University.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Gendreau, M., Iori, M., Laporte, G., Martello, S.: A tabu search algorithm for a routing and container loading problem. Transportation Science 40(3), 342–350 (2006)

    Article  Google Scholar 

  2. Fuellerer, G., Doerner, K.F., Hartl, R.F., Iori, M.: Metaheuristics for vehicle routing problems with three-dimensional loading constraints. European Journal of Operational Research 201(3), 751–759 (2010)

    Article  MATH  Google Scholar 

  3. Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem. Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (2001)

    Google Scholar 

  4. Chazelle: The bottomn-left bin-packing heuristic: An efficient implementation. IEEE Transactions on Computers C-32(8), 697–707 (1983)

    Google Scholar 

  5. Healy, P.: An optimal algorithm for rectangle placement. Operations Research Letters 24(1-2), 73–80 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  6. Bortfeldt, A.: A hybrid genetic algorithm for the container loading problem. European Journal of Operational Research 131(1), 143–161 (2001)

    Article  MATH  Google Scholar 

  7. Eley, M.: Solving container loading problems by block arrangement. European Journal of Operational Research 141(2), 393–409 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  8. Pisinger, D.: Heuristics for the container loading problem. European Journal of Operational Research 141(2), 382–392 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  9. Lim, A., Zhang, X.: The container loading problem. In: SAC 2005: Proceedings of the 2005 ACM Symposium on Applied Computing, pp. 913–917. ACM, New York (2005)

    Google Scholar 

  10. Lim, A., Rodrigues, B., Yang, Y.: 3-d container packing heuristics. Applied Intelligence 22(2), 125–134 (2005)

    Article  MATH  Google Scholar 

  11. Parreno, F., Alvarez-Valdes, R., Tamarit, J.M., Oliveira, J.F.: A maximal-space algorithm for the container loading problem. Informs Journal on Computing 20(3), 412–422 (2008)

    Article  MathSciNet  Google Scholar 

  12. Fanslau, T., Bortfeldt, A.: A tree search algorithm for solving the container loading problem. Informs Journal on Computing, ijoc.1090.0338+ (July 2009)

    Google Scholar 

  13. Baker, B.S., Coffman, E.G., Rivest, R.L.: Orthogonal packings in two dimensions. SIAM Journal on Computing 9(4), 846–855 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  14. Lodi, A., Martello, S., Vigo, D.: Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. Informs Journal on Computing 11(4), 345–357 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  15. Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12(4), 568–581 (1964)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, School of Information Science and Technology, Zhong Shan (Sun Yat-Sen) University, Guangzhou, Guangdong, P.R. China, (510275)

    Lei Wang, Songshan Guo & Shi Chen

  2. Department of Computer Science and Engineering, School of Engineering, Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong, S.A.R.

    Wenbin Zhu

  3. Department of Logistics and Maritime Studies, Faculty of Business, The Hong Kong Polytechnic University, Hung Hom, Howloon, Hong Kong, S.A.R.

    Wenbin Zhu

  4. Department of Management Sciences, College of Business, City University of Hong Kong, Tat Chee Ave, Kowloon Tong, Hong Kong, S.A.R.

    Andrew Lim

Authors
  1. Lei Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Songshan Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shi Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wenbin Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Andrew Lim
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science and Engineering, Seoul National University, 151-744, Seoul, Korea

    Byoung-Tak Zhang

  2. Department of Computing,, Macquarie University, NSW, Sydney, Australia

    Mehmet A. Orgun

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, L., Guo, S., Chen, S., Zhu, W., Lim, A. (2010). Two Natural Heuristics for 3D Packing with Practical Loading Constraints. In: Zhang, BT., Orgun, M.A. (eds) PRICAI 2010: Trends in Artificial Intelligence. PRICAI 2010. Lecture Notes in Computer Science(), vol 6230. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15246-7_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15246-7_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15245-0

  • Online ISBN: 978-3-642-15246-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics