Skip to main content
SpringerLink
Log in

AntPacking – An Ant Colony Optimization Approach for the One-Dimensional Bin Packing Problem

  • Conference paper
Evolutionary Computation in Combinatorial Optimization (EvoCOP 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3004))

Abstract

This paper deals with the one-dimensional bin packing problem and presents a metaheuristic solution approach based on Ant Colony Optimization. Some novel algorithm design features are proposed and the comprehensive computational study performed, shows both the contribution of using these features as well as the overall quality of the approach as compared to state of the art competing metaheuristics.

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. Dorigo, M., Di Caro, G.: The Ant Colony Optimization metaheuristic. In: Corne, D., et al. (eds.) New Ideas in Optimization, pp. 11–32. McGraw-Hill, UK (1999)

    Google Scholar 

  2. Dorigo, M., Stuetzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)

    Book  MATH  Google Scholar 

  3. Falkenauer, E., Delchambre, A.: A genetic algorithm for bin packing and line balancing. In: Proceedings of the IEEE 1992 International Conference on Robotics and Automation, Nice, France (1992)

    Google Scholar 

  4. Falkenauer, E.: A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics 2, 5–30 (1996)

    Article  Google Scholar 

  5. Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the theory of NP-Completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  6. Gutjahr, W.J.: ACO Algorithms with Guaranteed Convergence to the Optimal Solution. Information Processing Letters 82, 145–153 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  7. Levine, J., Ducatelle, F.: Ant Colony Optimisation and Local Search for Bin Packing and Cutting Stock Problems. Accepted for: Special Issue on Local Search, Journal of the Operational Research Society (2004)

    Google Scholar 

  8. Martello, S., Toth, P.: Knapsack Problems. Algorithms and Computer Implementations. Wiley & Sons, UK (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Management Science, University of Vienna, Bruenner Strasse 72, A-1210, Vienna, Austria

    Boris Brugger, Karl F. Doerner, Richard F. Hartl & Marc Reimann

  2. Institute for Operations Research, Swiss Federal Institute of Technology Zurich, Clausiusstrasse 47, CH-8092, Zurich, Switzerland

    Marc Reimann

Authors
  1. Boris Brugger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Karl F. Doerner
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Richard F. Hartl
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Marc Reimann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. SAP AG, Neurottstr. 16, 69190, Walldorf, Germany

    Jens Gottlieb

  2. Institute of Computer Graphics and Algorithms, Vienna University of Technology, Favoritenstraße 9–11/1861, 1040, Vienna, Austria

    Günther R. Raidl

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brugger, B., Doerner, K.F., Hartl, R.F., Reimann, M. (2004). AntPacking – An Ant Colony Optimization Approach for the One-Dimensional Bin Packing Problem. In: Gottlieb, J., Raidl, G.R. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2004. Lecture Notes in Computer Science, vol 3004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24652-7_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24652-7_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21367-3

  • Online ISBN: 978-3-540-24652-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation