Skip to main content

An Enhanced Whale Optimization Algorithm for the Two-Dimensional Irregular Strip Packing Problem

  • Conference paper
  • First Online:
Trends in Artificial Intelligence Theory and Applications. Artificial Intelligence Practices (IEA/AIE 2020)

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

  • 2254 Accesses

Abstract

In this paper, we propose an enhanced whale optimization algorithm for the two-dimensional strip packing problem, which requires cutting a given set of polygons from a sheet with fixed-width such that the used length of the sheet is minimized. Based on the original whale swarm algorithm, this algorithm introduces strategies such as adaptive weighting factors, local perturbation, and global beat variation, which can better balance the global optimization and local optimization search capabilities of the whale algorithm. The proposed algorithm was tested using the standard test case and compared with other algorithms in the literature. The results show that the proposed algorithm can improve the best-known solution for some instances.

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

Access this chapter

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

Similar content being viewed by others

References

  1. Bennell, J.A., Dowsland, K.A., Dowsland, W.B.: The irregular cutting-stock problem - a new procedure for deriving the no-fit polygon. Comput. Oper. Res. 28(3), 271–287 (2001)

    Article  Google Scholar 

  2. Bennell, J.A., Oliveira, J.F.: The geometry of nesting problems: a tutorial. Eur. J. Oper. Res. 184(2), 397–415 (2008)

    Article  MathSciNet  Google Scholar 

  3. Bennell, J.A., Song, X.: A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums. Comput. Oper. Res. 35(1), 267–281 (2008)

    Article  MathSciNet  Google Scholar 

  4. Burke, E., Hellier, R., Kendall, G., Whitwell, G.: Complete and robust no-fit polygon generation for the irregular stock cutting problem. Eur. J. Oper. Res. 179(1), 27–49 (2007)

    Article  Google Scholar 

  5. Dobkin, D., Hershberger, J., Kirkpatrick, D., Suri, S.: Computing the intersection-depth of polyhedra. Algorithmica 9(6), 518–533 (1993). https://doi.org/10.1007/BF01190153

    Article  MathSciNet  MATH  Google Scholar 

  6. Egeblad, J., Nielsen, B.K., Odgaard, A.: Fast neighborhood search for two- and three-dimensional nesting problems. Eur. J. Oper. Res. 183(3), 1249–1266 (2007)

    Article  MathSciNet  Google Scholar 

  7. Elkeran, A.: A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering. Eur. J. Oper. Res. 231(3), 757–769 (2013)

    Article  MathSciNet  Google Scholar 

  8. Hopper, E., Turton, B.C.H.: A review of the application of meta-heuristic algorithms to 2D strip packing problems. Artif. Intell. Rev. 16(4), 257–300 (2001). https://doi.org/10.1023/A:1012590107280

    Article  MATH  Google Scholar 

  9. Imamichi, T., Yagiura, M., Nagamochi, H.: An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem. Discrete Optim. 6(4), 345–361 (2009)

    Article  MathSciNet  Google Scholar 

  10. Leung, S.C., Lin, Y., Zhang, D.: Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem. Comput. Oper. Res. 39(3), 678–686 (2012)

    Article  MathSciNet  Google Scholar 

  11. Mirjalili, S., Lewis, A.: The whale optimization algorithm. Adv. Eng. Softw. 95, 51–67 (2016)

    Article  Google Scholar 

  12. Oliveira, J.F., Gomes, A.M., Ferreira, J.S.: TOPOS – a new constructive algorithm for nesting problems. OR Spektrum 22(2), 263–284 (2000). https://doi.org/10.1007/s002910050105

    Article  MathSciNet  MATH  Google Scholar 

  13. Sun, W., Wang, J., Wei, X.: An improved whale optimization algorithm based on different searching paths and perceptual disturbance. Symmetry 10(6), 210 (2018)

    Article  Google Scholar 

  14. Umetani, S., Yagiura, M., Imahori, S., Imamichi, T., Nonobe, K., Ibaraki, T.: Solving the irregular strip packing problem via guided local search for overlap minimization. Int. Trans. Oper. Res. 16(6), 661–683 (2009)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lijun Wei .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Liu, Q., Huang, Z., Zhang, H., Wei, L. (2020). An Enhanced Whale Optimization Algorithm for the Two-Dimensional Irregular Strip Packing Problem. In: Fujita, H., Fournier-Viger, P., Ali, M., Sasaki, J. (eds) Trends in Artificial Intelligence Theory and Applications. Artificial Intelligence Practices. IEA/AIE 2020. Lecture Notes in Computer Science(), vol 12144. Springer, Cham. https://doi.org/10.1007/978-3-030-55789-8_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-55789-8_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-55788-1

  • Online ISBN: 978-3-030-55789-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics