Skip to main content
SpringerLink
Log in

Tabu Search with Consistent Neighbourhood for Strip Packing

  • Conference paper
Trends in Applied Intelligent Systems (IEA/AIE 2010)

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

  • 2133 Accesses

Abstract

This paper introduces a new tabu search algorithm for a strip packing problem. It integrates several key features: A consistent neighborhood, a fitness function including problem knowledge, and a diversification based on the history of the search. The neighborhood only considers valid, sometimes partial, packings. The fitness function incorporates measures related to the empty spaces. Diversification relies on a set of historically “frozen” objects. Experimental results are shown on a set of well-known hard 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 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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Dowsland, K., Dowsland, W.: Packing Problems. Eur. J. Oper. Res. 56(1), 2–14 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  2. Fowler, R., Paterson, M., Tanimoto, S.: Optimal Packing and Covering in the Plane are NP-Complete. Inf. Process. Lett. 12(3), 133–137 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  3. Wäscher, G., Haußner, H., Schumann, H.: An Improved Typology of Cutting and Packing Problems. Eur. J. Oper. Res. 183(3), 1109–1130 (2007)

    Article  MATH  Google Scholar 

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

    Google Scholar 

  5. Alvarez-Valdes, R., Parreño, F., Tamarit, J.: Reactive GRASP for the Strip-Packing Problem. Comput. Oper. Res. 35(4), 1065–1083 (2008)

    Article  MATH  Google Scholar 

  6. Neveu, B., Trombettoni, G.: Strip Packing Based on Local Search and a Randomized Best-Fit. In: 5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems – 1st Workshop on Bin Packing and Placement Constraints (2008)

    Google Scholar 

  7. Neveu, B., Trombettoni, G., Araya, I.: Incremental Move for Strip-Packing. In: Avouris, N., Bourbakis, N., Hatzilygeroudis, I. (eds.) ICTAI 2007, vol. 2, pp. 489–496. IEEE Computer Society, Los Alamitos (2007)

    Google Scholar 

  8. 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 

  9. Hamiez, J.P., Robet, J., Hao, J.K.: A Tabu Search Algorithm with Direct Representation for Strip Packing. In: Cotta, C., Cowling, P. (eds.) EvoCOP 2009. LNCS, vol. 5482, pp. 61–72. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  10. Alvarez-Valdes, R., Parreño, F., Tamarit, J.: A Tabu Search Algorithm for a Two-Dimensional Non-Guillotine Cutting Problem. Eur. J. Oper. Res. 183(3), 1167–1182 (2007)

    Article  MATH  Google Scholar 

  11. Iori, M., Martello, S., Monaci, M.: Metaheuristic Algorithms for the Strip Packing Problem. In: Pardalos, P., Korotkikh, V. (eds.) Optimization and Industry – New Frontiers. Appl. Optim., vol. 78, pp. 159–179. Springer, Heidelberg (2003)

    Google Scholar 

  12. Bortfeldt, A.: A Genetic Algorithm for the Two-Dimensional Strip Packing Problem with Rectangular Pieces. Eur. J. Oper. Res. 172(3), 814–837 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  13. 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. Stud. Comput. Intell, vol. 136, pp. 61–76. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  14. Kenmochi, M., Imamichi, T., Nonobe, K., Yagiura, M., Nagamochi, H.: Exact Algorithms for the Two-Dimensional Strip Packing Problem with and without Rotations. Eur. J. Oper. Res. 198(1), 73–83 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  15. Martello, S., Monaci, M., Vigo, D.: An Exact Approach to the Strip Packing Problem. INFORMS J. Comput. 15(3), 310–319 (2003)

    Article  MathSciNet  Google Scholar 

  16. Glover, F., Laguna, M.: Tabu Search. Kluwer, Dordrecht (1997)

    MATH  Google Scholar 

  17. Baker, B., Coffman Jr., E., Rivest, R.: Orthogonal Packings in Two Dimensions. SIAM J. Comput. 9(4), 846–855 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  18. El Hayek, J.: Le Problème de Bin-Packing en Deux-Dimensions, le Cas Non-Orienté : Résolution Approchée et Bornes Inférieures (in French). PhD thesis, Université de Technologie de Compiègne, France (2006)

    Google Scholar 

  19. Hopper, E., Turton, B.: An Empirical Investigation of Meta-Heuristic and Heuristic Algorithms for a 2D Packing Problem. Eur. J. Oper. Res. 128(1), 34–57 (2001)

    Article  MATH  Google Scholar 

  20. Chazelle, B.: The Bottom-Left Bin-Packing Heuristic – An Efficient Implementation. IEEE Trans. Comput. 32(8), 697–707 (1983)

    Article  MATH  Google Scholar 

  21. 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 Comput. & Inf. Sc. Ser, vol. 13, ch. 36. 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

    Giglia Gómez-Villouta, Jean-Philippe Hamiez & Jin-Kao Hao

Authors
  1. Giglia Gómez-Villouta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean-Philippe Hamiez
    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. of Computing and Numerical Analysis, University of Cordoba, Campus Universitario de Rabanales, Einstein Building, 3rd floor, 14071, Cordoba, Spain

    Nicolás García-Pedrajas

  2. Dept. of Computer Science and Artificial Intelligence, ETS de Ingenierias Informática y de Telecomunicación, University of Granada, 18071, Granada, Spain

    Francisco Herrera

  3. School of Computing, University of the West of Scotland, PA1 2BE, Paisley, UK

    Colin Fyfe

  4. Dept. Computer Science and Artificial Intelligence, ETS de Ingenierias Informática y de Telecomunicación, University of Granada, 18071, Granada, Spain

    José Manuel Benítez

  5. Department of Computer Science, Texas State University-San Marcos, 601 University Drive, TX 78666-4616, San Marcos, USA

    Moonis Ali

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gómez-Villouta, G., Hamiez, JP., Hao, JK. (2010). Tabu Search with Consistent Neighbourhood for Strip Packing. In: García-Pedrajas, N., Herrera, F., Fyfe, C., Benítez, J.M., Ali, M. (eds) Trends in Applied Intelligent Systems. IEA/AIE 2010. Lecture Notes in Computer Science(), vol 6096. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13022-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13022-9_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13021-2

  • Online ISBN: 978-3-642-13022-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation