Skip to main content
SpringerLink
Log in
Book cover

Multidisciplinary Methods for Analysis Optimization and Control of Complex Systems pp 233–247Cite as

An Ant System Heuristic for the Two-Dimensional Finite Bin Packing Problem: preliminary results

  • Conference paper

Part of the book series: Mathematics in Industry ((TECMI,volume 6))

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   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
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover 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. Bengtsson, B.: 1982, ‘Packing rectangular pieces-a heuristic approach’. The Computing Journal 25, 353–357.

    MathSciNet  Google Scholar 

  2. Berkey, J. and P. Wang: 1987, ‘Two dimensional finite bin packing algorithms’. Journal of Operational Research Society 38, 423–429.

    MATH  Google Scholar 

  3. Boschetti, M. and A. Mingozzi: 2003a, ‘The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case’. 4OR 1(1), 27–42.

    Article  MathSciNet  MATH  Google Scholar 

  4. Boschetti, M. and A. Mingozzi: 2003b, ‘The two-dimensional finite bin packing problem. Part II: New lower and upper bounds’. 4OR 1(2), 135–148.

    Article  MathSciNet  MATH  Google Scholar 

  5. Chung, F., M. Garey, and D. Johnson: 1982, ‘On packing two-dimensional bins’. SIAM Journal on Algebraic and Discrete Methods 3, 66–76.

    MathSciNet  MATH  Google Scholar 

  6. Colorni, A., M. Dorigo, and V. Maniezzo: 1991, Distributed Optimization by Ant Colonies, Proceedings of ECAL’91, European Conference on Artificial Life. Elsevier Publishing.

    Google Scholar 

  7. Dell'Amico, M., S. Martello, and D. Vigo: 2001, ‘A lower bound for the nonoriented two-dimensional bin packing problems’. to appear in Discrete Applied Mathematics.

    Google Scholar 

  8. Dorigo, M.: 1992, Optimization, Learning and Natural Algorithms, Ph.D. Thesis. Milano: Politecnico di Milano.

    Google Scholar 

  9. Dorigo, M., A. Colorni, and V. Maniezzo: 1991, ‘Positive Feedback as a Search Strategy’. Technical Report TR91-016, Politecnico di Milano.

    Google Scholar 

  10. Dorigo, M. and L. M. Gambardella: 1997, ‘Ant Colony System: a cooperative learning approach to the Traveling Salesman Problem’. IEEE Transaction on Evolutionary Computation 1, 53–66.

    Google Scholar 

  11. Dorigo, M., V. Maniezzo, and A. Colorni: 1996, ‘The Ant System: optimization by a colony of cooperating agents’. IEEE Transactions on Systems, Man, and Cybernetics-Part B 26(1), 29–41.

    Google Scholar 

  12. Dowsland, K. and W. Dowsland: 1992, ‘Packing problems’. European Journal of Oprational Research 56, 2–14.

    MATH  Google Scholar 

  13. Dyckhoff, H. and U. Finke: 1992, Cutting and packing in production and distribution. Physica Verlag, Heidelberg.

    Google Scholar 

  14. Dyckhoff, H., G. Scheithauer, and J. Terno: 1997, ‘Cutting and packing (C & P)’. in: M. Dell’Amico, F. Maffioli, S. Martello (Eds.), Annotated Bibliographies in Combinatorial Optimization, Wiley, Chichester pp. 393–413.

    Google Scholar 

  15. El-Bouri, A., N. Popplewell, S. Balakrishnan, and A. Alfa: 1994, ‘A search based heuristic for the two-dimensional bin-packing problem’. INFOR 32, 265–274.

    MATH  Google Scholar 

  16. Faroe, O., D. Pisinger, and M. Zachariasen: 2003, ‘Guided local search for the three-dimensional bin packing problem’. INFORMS Journal on Computing 15, 267–283.

    Article  MathSciNet  Google Scholar 

  17. Fekete, S. P. and J. Schepers: 2000, ‘On more-dimensional packing II: Bounds’. Technical Report 97.289, Universität zu Köln, Germany.

    Google Scholar 

  18. Frenk, J. and G. Galambos: 1987, ‘Hybrid next fit algorithm for the two dimensional rectangle bin packing problem’. Computing 39, 201–217.

    MathSciNet  MATH  Google Scholar 

  19. Garey, M. and D. Johnson: 1979, Computer and intractability, a guide to the theory of NP-completeness. Freeman, New York.

    Google Scholar 

  20. Lodi, A., S. Martello, and M. Monaci: 2002, ‘The two-dimensional packing problems: a survey’. European Journal of Operational Research 141, 241–252.

    MathSciNet  MATH  Google Scholar 

  21. Lodi, A., S. Martello, and D. Vigo: 1999, ‘Heuristic and Metaheuristic Approaches for a class of two-dimensional bin packing problems’. INFORMS Journal on Computing 11, 345–357.

    MathSciNet  MATH  Google Scholar 

  22. Maniezzo, V.: 1998, Exact and Approximate Nondeterministic Tree-search Procedures for the Quadratic Assignment Problem, Vol. (to appear on: INFORMS Journal of Computing) of Technical Report CSR 98-1. University of Bologna:.

    Google Scholar 

  23. Martello, S. and D. Vigo: 1998, ‘Exact solution of the two dimensional finite bin packing problem’. Management Science 44, 388–399.

    Article  MATH  Google Scholar 

  24. Pisinger, D. and M. Sigurd: 2003, ‘Using decomposition techniques and constraint programming for solving the two-dimensional bin packing problem’. Technical Report 03/01, DIKU, University of Copenhagen, Danmark.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Bologna, Bologna, Italy

    Marco A. Boschetti

  2. Department of Mathematics, University of Bologna, Bologna, Italy

    Vittorio Maniezzo

Authors
  1. Marco A. Boschetti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vittorio Maniezzo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. MIRIAM & Department of Mathematics, University of Milano, Via C. Saldini 50, 20133, Milano, Italy

    Vincenzo Capasso

  2. Pole Scientifique — Dassault Aviation, UPMC Dassault Aviation, 78 Quai Marcel Dassault, 99214, Saint-Cloud, France

    Jacques Périaux

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boschetti, M.A., Maniezzo, V. (2005). An Ant System Heuristic for the Two-Dimensional Finite Bin Packing Problem: preliminary results. In: Capasso, V., Périaux, J. (eds) Multidisciplinary Methods for Analysis Optimization and Control of Complex Systems. Mathematics in Industry, vol 6. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-27167-8_7

Download citation

Publish with us

Policies and ethics

Search

Navigation