Abstract
This article shows some techniques based on simulated annealing and genetic alghoritms for the resolution of a filling problem of a container of two dimensions using rectangular pieces of sizes not congruent. This problem is quite related to problems like bin-packing or strip-packing. The comparative was made using several type problems and having into account parameters like run time, number of solutions that converge to the optimum one and quality of the found non-optimum solutions.
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
Hopper, E., Turton, B.C.H.: An empirical investigation of Mete-heuristic and Heuristic algorithms for a 2D packing problem, E.J.O.R 128/1,pp. 34-57 (2000)
Dowsland, K.A.: Heuristic desirn and fundamentals of the Simulated Annealing. Revista Iberoamericana de Inteligencia Artificial N 19, 93–102 (2003)
Gómez, A.: Resolución de problemas de packing en una empresa de calcamonias mediante algoritmos geneticos, XII congreso nacional y VII congreso Hispano-Francs de AEDEM, pp. 999-1008 (1998)
Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer, Heidelberg (1994)
Gómez, A.: Resolución del problema de Strip-Packing mediante la metaheurstica algoritmos genticos, Boletn de la SEIO, pp. 12-16 (2000)
Metrópolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H.: Equation of state calculations by fast computing machines. The Journal of Chemical Physics 21(6), 1087–1091 (1953)
Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. Journal of Global Optimization 6, 109–133 (1995)
Glover, F., Laguna, M.: Taby search. Kluwer Academic Publishers, Dordrecht (1997)
Goldber, D.E.: Genetic algorithm in search, optimization and machine learning. Addison-Wesley, Reading (1989)
Kirkpatrick, S.: Optimization by simulate annealing: quantitative studies. Journal of Statistical Physics 34, 975–986 (1984)
Dorigo, M., Sttzle, T.: The ant colony optimization metaheuristic: Algorithms, applications, and advances, 2001. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics (2001)
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
Pineda, M.D., De Pedro Salinas, J.M., Almansa, J.A. (2005). A Study of Heuristic Techniques Inspired in Natural Process for the Solution of the Container Fill Problem. In: Mira, J., Álvarez, J.R. (eds) Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach. IWINAC 2005. Lecture Notes in Computer Science, vol 3562. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11499305_18
Download citation
DOI: https://doi.org/10.1007/11499305_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26319-7
Online ISBN: 978-3-540-31673-2
eBook Packages: Computer ScienceComputer Science (R0)