Abstract
This paper presents a new hybrid intelligent system that solves the Bin Packing Problem. The methodology involves the fusion of Soft Computing by means a genetic algorithm and Hard Computing using limits criterion and deterministic strategies. The innovative proposal inverts minimum computational resources expressed in generations with a high level quality solution and shows the algorithm performance with statistical methods. The average theoretical ratio for 1370 standard instances was 1.002 and the best known solution was achieved in 83.72% of the cases. As future work, an exhaustive analysis of characteristics of the hardest instances is proposed; the purpose is to find new hybrid methods.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baase, S.: Computer Algorithms, Introduction to Design and Analysis, Editorial Addison-Wesley Publishing Company, (1998)
Falkenauer E.: A Hybrid Grouping Genetic Algorithm for Bin Packing, CRIF — Research Centre for Belgian Metalworking Industry Industrial Management and Automation, (1996)
Ovaska S. J., Kamiya A., Chen YQ.: Fusion of Soft Computing and Hard Computing: Computational Structures and Characteristic Features, IEEE Transactions on Systems, Man, and Cybernetics-Part C: Applications and Reviews, VOL. 36, NO. 3, MAY 2006
Ducatelle F.: Ant Colony Optimisation for Bin Packing and Cutting Stock Problems, School of Artificial Intelligence, University of Edinburgh, (2001)
Alvim A., Ribeiro C., Glover F., Aloise D.: A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem. Research report, Catholic University of Rio de Janeiro, Department of Computer Science, Rio de Janeiro, Brazil, (2003)
Martello S., Toth P.: Lower Bounds and Reduction Procedures for the Bin Packing Problem, in Discrete Applied Mathematics, Holland, Elsevier Science Publishers, (1990).
Nieto, D., Tomas, P., Castilla, G., Fraire, H., Cruz, L.: Configuración de Algoritmos Genéticos para el Problema de Empacado de Objetos, 13th International Congress on Computer Science Research (CIICC), Cd. Madero Tamaulipas México, 2006.
Martello S., Toth P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley & Sons Ltd. (1990)
Beasley—s OR-Library, http://www.ms.ic.ac.uk/info.html
Operational Research Library, http://www.bwl.tu-darmstadt.de/bwl3/forsch/projekte/binpp
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Cruz-Reyes, L., Nieto-Yáñez, D.M., Tomás-Solis, P., Valdez, G.C. (2007). Solving Bin Packing Problem with a Hybridization of Hard Computing and Soft Computing. In: Corchado, E., Corchado, J.M., Abraham, A. (eds) Innovations in Hybrid Intelligent Systems. Advances in Soft Computing, vol 44. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74972-1_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-74972-1_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74971-4
Online ISBN: 978-3-540-74972-1
eBook Packages: EngineeringEngineering (R0)