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
Bengtsson, B.: 1982, ‘Packing rectangular pieces-a heuristic approach’. The Computing Journal 25, 353–357.
Berkey, J. and P. Wang: 1987, ‘Two dimensional finite bin packing algorithms’. Journal of Operational Research Society 38, 423–429.
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.
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.
Chung, F., M. Garey, and D. Johnson: 1982, ‘On packing two-dimensional bins’. SIAM Journal on Algebraic and Discrete Methods 3, 66–76.
Colorni, A., M. Dorigo, and V. Maniezzo: 1991, Distributed Optimization by Ant Colonies, Proceedings of ECAL’91, European Conference on Artificial Life. Elsevier Publishing.
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.
Dorigo, M.: 1992, Optimization, Learning and Natural Algorithms, Ph.D. Thesis. Milano: Politecnico di Milano.
Dorigo, M., A. Colorni, and V. Maniezzo: 1991, ‘Positive Feedback as a Search Strategy’. Technical Report TR91-016, Politecnico di Milano.
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.
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.
Dowsland, K. and W. Dowsland: 1992, ‘Packing problems’. European Journal of Oprational Research 56, 2–14.
Dyckhoff, H. and U. Finke: 1992, Cutting and packing in production and distribution. Physica Verlag, Heidelberg.
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.
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.
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.
Fekete, S. P. and J. Schepers: 2000, ‘On more-dimensional packing II: Bounds’. Technical Report 97.289, Universität zu Köln, Germany.
Frenk, J. and G. Galambos: 1987, ‘Hybrid next fit algorithm for the two dimensional rectangle bin packing problem’. Computing 39, 201–217.
Garey, M. and D. Johnson: 1979, Computer and intractability, a guide to the theory of NP-completeness. Freeman, New York.
Lodi, A., S. Martello, and M. Monaci: 2002, ‘The two-dimensional packing problems: a survey’. European Journal of Operational Research 141, 241–252.
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.
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:.
Martello, S. and D. Vigo: 1998, ‘Exact solution of the two dimensional finite bin packing problem’. Management Science 44, 388–399.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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
DOI: https://doi.org/10.1007/3-540-27167-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22310-8
Online ISBN: 978-3-540-27167-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)