Abstract
The two-dimensional bin-packing problem (2D-BPP) with rotations is an important optimization problem which has a large number of practical applications. It consists of the non-overlapping placement of a set of rectangular pieces in the lowest number of bins of a homogenous size, with the edges of these pieces always parallel to the sides of bins, and with free 90 degrees rotation. A large number of methods have been proposed to solve this problem, including heuristic and meta-heuristic approaches. This paper presents a new memetic algorithm to solve the 2D-BPP that incorporates some operators specially designed for this problem. The performance of this memetic algorithm is compared with two other heuristics previously proposed by other authors in ten classes of frequently used benchmark problems. It is observed that, in some cases, the method here proposed is able to equal or even outperform to the results of the other two heuristics in most test problems.
This is a preview of subscription content, log in via an institution to check access.
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
Berkey, J.O., Wang, P.Y.: Two dimensional finite bin-packing algorithms. J. Oper. Res. Soc. 38, 423–429 (1987), http://www.jstor.org/pss/2582731
Dawkins, R.: The selfish gene. Oxford University Press, New York (1976)
Kad, D.-J.: An analysis of the behavior of a class of genetic adaptive systems. Diss. Abstr. Int. 36(10), 5140B (1975)
El Hayek, J., Moukrim, A., Negre, E.S.: New resolution algorithm and pretreatments for the two-dimensional bin-packing problem. Comput. Oper. Res. 35, 3184–3201 (2008)
Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman & Company, San Francisco (1979)
Hopper, E., Turton, B.C.H.: A review of the application of meta-heuristic algorithms to 2D Strip Packing Problems. Artif. Intell. Rev. 16, 257–300 (2001)
Lodi, A., Martello, S., Vigo, D.: Recent advances on two-dimensional bin-packing problems. Discret. Appl. Math. 123, 379–396 (2002)
Lodi, A., Martello, S., Vigo, D.: TSpack: A unified tabu search code for multi-dimensional bin packing problems. Ann. Oper. Res. 131, 203–213 (2004)
Martello, S., Vigo, D.: Exact solution of the two-dimensional finite bin packing problem. Manag. Sci. 44, 388–399 (1998)
Mohamed-Ahemed, B., Yassine, A.: Optimization by ant colony hybrid for the bin-packing problem. World Acad. of Sci. Eng. and Technol. 49, 354–357 (2009)
Moscato, P.: On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. California Institute of Technology Technical Report C3P 826, Pasadena, CA (1989)
Moscato, P.: Memetic algorithms: A short introduction, New Ideas in Optimization, pp. 219–234. McGraw-Hill, New York (1999)
Stawowy, A.: Evolutionary based heuristic for bin packing problem. Comput. Ind. Eng. 55(2), 465–474 (2008)
Wong, L., Lee, L.S.: Heuristic placement routines for two-dimensional bin packing problem. J. Math Stat. 5(4), 334–341 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fernández, A., Gil, C., Márquez, A.L., Baños, R., Montoya, M.G., Alcayde, A. (2010). A New Memetic Algorithm for the Two-Dimensional Bin-Packing Problem with Rotations. In: de Leon F. de Carvalho, A.P., Rodríguez-González, S., De Paz Santana, J.F., Rodríguez, J.M.C. (eds) Distributed Computing and Artificial Intelligence. Advances in Intelligent and Soft Computing, vol 79. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14883-5_69
Download citation
DOI: https://doi.org/10.1007/978-3-642-14883-5_69
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14882-8
Online ISBN: 978-3-642-14883-5
eBook Packages: EngineeringEngineering (R0)