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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Dorigo, M., Stuetzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
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)
Falkenauer, E.: A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics 2, 5–30 (1996)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the theory of NP-Completeness. Freeman, San Francisco (1979)
Gutjahr, W.J.: ACO Algorithms with Guaranteed Convergence to the Optimal Solution. Information Processing Letters 82, 145–153 (2002)
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)
Martello, S., Toth, P.: Knapsack Problems. Algorithms and Computer Implementations. Wiley & Sons, UK (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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