Skip to main content
SpringerLink
Log in
Book cover

European Conference on Evolutionary Computation in Combinatorial Optimization

EvoCOP 2009: Evolutionary Computation in Combinatorial Optimization pp 61–72Cite as

A Tabu Search Algorithm with Direct Representation for Strip Packing

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5482))

Abstract

This paper introduces a new tabu search algorithm for a two-dimensional (2D) Strip Packing Problem (2D-SPP). It integrates several key features: A direct representation of the problem, a satisfaction-based solving scheme, two different complementary neighborhoods, a diversification mechanism and a particular tabu structure. The representation allows inexpensive basic operations. The solving scheme considers the 2D-SPP as a succession of satisfaction problems. The goal of the combination of two neighborhoods is (to try) to reduce the height of the packing while avoiding solutions with (hard to fill) tall and thin wasted spaces. Diversification relies on a set of historically “interesting” packings. The tabu structure avoids visiting similar packings. To assess the proposed approach, experimental results are shown on a set of well-known benchmark instances and compared with previously reported tabu search algorithms as well as the best performing algorithms.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Wäscher, G., Haußner, 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 

  2. Dowsland, K., Dowsland, W.: Packing problems. European Journal of Operational Research 56(1), 2–14 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  3. Sweeney, P., Ridenour Paternoster, E.: Cutting and packing problems: A categorized, application-orientated research bibliography. Journal of the Operational Research Society 43(7), 691–706 (1992)

    Article  MATH  Google Scholar 

  4. Fowler, R., Paterson, M., Tanimoto, S.: Optimal packing and covering in the plane are NP-complete. Information Processing Letters 12(3), 133–137 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  5. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completness. W.H. Freeman and Company, San Francisco (1979)

    MATH  Google Scholar 

  6. Alvarez-Valdes, R., Parreño, F., Tamarit, J.: Reactive GRASP for the strip-packing problem. Computers & Operations Research 35(4), 1065–1083 (2008)

    Article  MATH  Google Scholar 

  7. Neveu, B., Trombettoni, G.: Strip packing based on local search and a randomized best-fit. In: Fifth International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: First Workshop on Bin Packing and Placement Constraints (CPAIOR: BPPC), Paris, France, May 22 (2008)

    Google Scholar 

  8. Neveu, B., Trombettoni, G., Araya, I.: Incremental move for strip-packing. In: Avouris, N., Bourbakis, N., Hatzilygeroudis, I. (eds.) Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), vol. 2, pp. 489–496. IEEE Computer Society, Los Alamitos (2007)

    Chapter  Google Scholar 

  9. Soke, A., Bingul, Z.: Hybrid genetic algorithm and simulated annealing for two-dimensional non-guillotine rectangular packing problems. Engineering Applications of Artificial Intelligence 19(5), 557–567 (2006)

    Article  Google Scholar 

  10. Zhang, D., Kang, Y., Deng, A.: A new heuristic recursive algorithm for the strip rectangular packing problem. Computers & Operations Research 33(8), 2209–2217 (2006)

    Article  MATH  Google Scholar 

  11. Zhang, D., Liu, Y., Chen, S., Xie, X.: A meta-heuristic algorithm for the strip rectangular packing problem. In: Wang, L., Chen, K., S. Ong, Y. (eds.) ICNC 2005. LNCS, vol. 3612, pp. 1235–1241. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  12. Alvarez-Valdes, R., Parreño, F., Tamarit, J.: A tabu search algorithm for a two-dimensional non-guillotine cutting problem. European Journal of Operational Research 183(3), 1167–1182 (2007)

    Article  MATH  Google Scholar 

  13. Iori, M., Martello, S., Monaci, M.: Metaheuristic algorithms for the strip packing problem. In: Pardalos, P.M., Korotkikh, V. (eds.) Optimization and Industry: New Frontiers. Applied Optimization, vol. 78, pp. 159–179. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  14. Gómez-Villouta, G., Hamiez, J.P., Hao, J.K.: A dedicated genetic algorithm for two-dimensional non-guillotine strip packing. In: Proceedings of the 6th Mexican International Conference on Artificial Intelligence, Special Session, MICAI, Aguascalientes, Mexico, pp. 264–274. IEEE Computer Society, Los Alamitos (2007)

    Google Scholar 

  15. Bortfeldt, A.: A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces. European Journal of Operational Research 172(3), 814–837 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  16. Mukhacheva, E., Mukhacheva, A.: The rectangular packing problem: Local optimum search methods based on block structures. Automation and Remote Control 65(2), 248–257 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  17. Yeung, L., Tang, W.: Strip-packing using hybrid genetic approach. Engineering Applications of Artificial Intelligence 17(2), 169–177 (2004)

    Article  Google Scholar 

  18. Leung, T., Chan, C., Troutt, M.: Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem. European Journal of Operational Research 145(3), 530–542 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  19. Gomez, A., de la Fuente, D.: Solving the packing and strip-packing problems with genetic algorithms. In: Mira, J., Sánchez-Andrés, J. (eds.) IWANN 1999. LNCS, vol. 1606, pp. 709–718. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  20. Neveu, B., Trombettoni, G., Araya, I., Riff, M.C.: A strip packing solving method using an incremental move based on maximal holes. International Journal on Artificial Intelligence Tools 17(5), 881–901 (2008)

    Article  Google Scholar 

  21. Araya, I., Neveu, B., Riff, M.C.: An efficient hyperheuristic for strip-packing problems. In: Cotta, C., Sevaux, M., Sörensen, K. (eds.) Adaptive and Multilevel Metaheuristics. Studies in Computational Intelligence, vol. 136, pp. 61–76. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  22. Kenmochi, M., Imamichi, T., Nonobe, K., Yagiura, M., Nagamochi, H.: Exact algorithms for the 2-dimensional strip packing problem with and without rotations. European Journal of Operational Research (2008) (to appear)

    Google Scholar 

  23. Bekrar, A., Kacem, I., Chu, C.: A comparative study of exact algorithms for the two dimensional strip packing problem. Journal of Industrial and Systems Engineering 1(2), 151–170 (2007)

    Google Scholar 

  24. Lesh, N., Marks, J., McMahon, A., Mitzenmacher, M.: Exhaustive approaches to 2D rectangular perfect packings. Information Processing Letters 90(1), 7–14 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  25. Martello, S., Monaci, M., Vigo, D.: An exact approach to the strip packing problem. INFORMS Journal on Computing 15(3), 310–319 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  26. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1997)

    Book  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  28. Hopper, E., Turton, B.: An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. European Journal of Operational Research 128(1), 34–57 (2001)

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  30. El Hayek, J.: Le problème de bin-packing en deux-dimensions, le cas non-orienté : résolution approchée et bornes inférieures. Ph.D thesis, Université de Technologie de Compiègne, France (2006) (in French)

    Google Scholar 

  31. Imahori, S., Yagiura, M., Nagamochi, H.: Practical algorithms for two-dimensional packing. In: Gonzalez, T. (ed.) Handbook of Approximation Algorithms and Metaheuristics. Chapman & Hall/CRC Computer & Information Science Series, ch. 36, vol. 13. CRC Press, Boca Raton (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LERIA, Université d’Angers, 2 Bd. Lavoisier, 49045, Angers, France

    Jean-Philippe Hamiez, Julien Robet & Jin-Kao Hao

Authors
  1. Jean-Philippe Hamiez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Julien Robet
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jin-Kao Hao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. Lenguajes y Ciencias de la Computación, ETSI Informática, Universidad de Málaga, Campus Teatinos, 29071, Málaga, Spain

    Carlos Cotta

  2. Department of Computing, University of Bradford, BD7 1DP, Bradford, UK

    Peter Cowling

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hamiez, JP., Robet, J., Hao, JK. (2009). A Tabu Search Algorithm with Direct Representation for Strip Packing. In: Cotta, C., Cowling, P. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2009. Lecture Notes in Computer Science, vol 5482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01009-5_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01009-5_6

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation