Skip to main content
SpringerLink
Log in

A Novel Learning Algorithm for Pallet Grouping Technology

  • Conference paper
Computational Intelligence, Networked Systems and Their Applications (ICSEE 2014, LSMS 2014)

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

  • 2353 Accesses

Abstract

The Pallet Grouping Problem (PGP) is defined as minimizing the number of pallets for placing all materials in a collection and distribution center. A key to solving the PGP is to tackle the Pallet Loading Problem (PLP). The Pallet Loading Problem aims to maximize the number of identical rectangular boxes placed within a rectangular pallet. All boxes have identical rectangular dimensions and, when placed, must be located completely within the pallet. In this paper, a novel pallet grouping technology is proposed and a new learning algorithm, namely Learning Only from Excellence, (LOE) is presented for solving the pallet loading problem. Simulation results show that compared with the conventional Genetic Algorithm (AG) for two pallet loading problems with different scales, the new learning algorithm is proved to be more efficiently.

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 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. Dyckhoff, H.: A Typology of Cutting and Packing Problems. Euro. J. Oper. Res. 44, 145–159 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  2. Pureza, V., Morabito, R.: Some Experiments with a Simple Tabu Search Algorithm for the Manufacturer’s Pallet Loading Problem. Com. Oper. Res. 33, 804–819 (2006)

    Article  MATH  Google Scholar 

  3. Hodgson, T.: A Combined Approach to the Pallet Loading Problem. IIE Trans. 14, 176–182 (1982)

    Google Scholar 

  4. Molaei, S., Vahdani, B., Molaei, S.: A Molecular Algorithm for an Operation-based Job Shop Scheduling Problem. Arab. J. Sci. Eng. 38, 2993–3003 (2013)

    Article  MathSciNet  Google Scholar 

  5. Sait, S.M., Zaidi, A.M., Ali, M.I., Khan, K.S., Syed, S.: Exploring Asynchronous MMC-based Parallel SA Schemes for Multiobjective Cell Placement on a Cluster of Workstations. Arab. J. Sci. Eng. 36, 259–278 (2011)

    Article  Google Scholar 

  6. Fadaei, M., Zandieh, M.: Scheduling a Bi-objective Hybrid Flow Shop with Sequence-Dependent Family Setup Times using Metaheuristics. Arab. J. Sci. Eng. 38, 2233–2244 (2013)

    Article  Google Scholar 

  7. Lau, H.C.W., Chan, T.M., Tsui, W.T., Ho, G.T.S., Choy, K.L.: An AI Approach for Optimizing Multi-pallet Loading Operations. Exp. Sys. App. 36, 4296–4312 (2009)

    Article  Google Scholar 

  8. Kocjan, W., Holmström, K.: Computing Stable Loads for Pallets. Euro. J. Oper. Res. 207, 980–985 (2010)

    Article  MATH  Google Scholar 

  9. Bhattacharya, R., Roy, R., Bhattacharya, S.: An Exact Depth-first Algorithm for the Pallet Loading Problem. Euro. J. Oper. Res. 110, 610–625 (1998)

    Article  MATH  Google Scholar 

  10. Alvarez-Valdez, R., Parrel, F., Tamarit, J.M.: A Branch-and-cut Algorithm for the Pallet Loading Problem. Com. Oper. Res. 32, 3007–3029 (2005)

    Article  Google Scholar 

  11. Martins, G.H.A., Dell, R.F.: The Minimum Size Instance of a Pallet Loading Problem Equivalence Class. Euro. J. Oper. Res. 179, 17–26 (2007)

    Article  MATH  Google Scholar 

  12. Ribeiro, G.M., Lorena, L.A.N.: Lagrangean Relaxation with Clusters and Column Generation for the Manufacturer’s Pallet Loading Problem. Com. Oper. Res. 34, 2695–2708 (2007)

    Article  MATH  Google Scholar 

  13. Pureza, V., Morabito, R.: Some Experiments with a Simple Tabu Search Algorithm for the Manufacturer’s Pallet Loading Problem. Com. Oper. Res. 33, 804–819 (2006)

    Article  MATH  Google Scholar 

  14. Martins, G.H.A., Dell, R.F.: Solving the Pallet Loading Problem. Euro. J. Ope. Res. 184, 429–440 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  15. Yaman, H., Şen, A.: Manufacturer’s Mixed Pallet Design Problem. Euro. J. Ope. Res. 186, 826–840 (2008)

    Article  MATH  Google Scholar 

  16. Scheithauer, G., Terno, J.: The G4-heuristic for the Pallet Loading Problem. J. Oper. Res. Soc. 47, 511–522 (1996)

    Article  MATH  Google Scholar 

  17. Lins, L., Lins, S., Morabito, R.: An L-approach for Packing (l,w)-rectangles into Rectangular and L-shaped Pieces. J. Oper. Res. Soc. 54, 777–789 (2003)

    Article  MATH  Google Scholar 

  18. Birgin, E.G., Morabito, R., Nishihara, F.H.: A Note on an L-approach for Solving the Manufacturer’s Pallet Loading Problem. J. Oper. Res. Soc. 56, 1448–1451 (2005)

    Article  MATH  Google Scholar 

  19. Alvarez-Valdez, R., Parre, F., Tamarit, J.M.: A Tabu Search Algorithm for Pallet Loading Problem. OR Spectrum 27, 43–61 (2005)

    Article  Google Scholar 

  20. Kanga, K., Moonb, I., Wang, H.: A Hybrid Genetic Algorithm with a New Packing Strategy for the Three-Dimensional Bin Packing Problem. App. Math. Com. 219, 1287–1299 (2012)

    Article  Google Scholar 

  21. Lian, Z.G., Gu, X.S., Jiao, B.: A Dual Similar Particle Swarm Optimization Algorithm for Job-shop Scheduling with Penalty. In: Proceedings of the 6th World Congress on Control and Automation, pp. 7312–7316. IEEE Press, New York (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Shanghai DianJi University, 200240, Shanghai, China

    Weitian Lin, Zhigang Lian & Bin Jiao

  2. Key Laboratory of Advanced Control and Optimization for Chemical Processes of Ministry of Education, East China University of Science and Technology, 200237, Shanghai, China

    Xingsheng Gu

  3. Shanghai Electric Group Co., Ltd. Central Academe, 200070, Shanghai, China

    Wei Xu

Authors
  1. Weitian Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhigang Lian
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bin Jiao
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xingsheng Gu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Wei Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Shanghai Key Laboratory of Power Station Automation Technology, School of Mechatronics Engineering and Automation Shanghai University, Shanghai, China

    Minrui Fei

  2. Shanghai University, China

    Chen Peng , Zhou Su  & Yang Song ,  & 

  3. Central Queensland University, 4700, Rockhampton, Australia

    Qinglong Han

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lin, W., Lian, Z., Jiao, B., Gu, X., Xu, W. (2014). A Novel Learning Algorithm for Pallet Grouping Technology. In: Fei, M., Peng, C., Su, Z., Song, Y., Han, Q. (eds) Computational Intelligence, Networked Systems and Their Applications. ICSEE LSMS 2014 2014. Communications in Computer and Information Science, vol 462. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45261-5_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-45261-5_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-45260-8

  • Online ISBN: 978-3-662-45261-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation