Advertisement

Solving Bin Packing Problem with a Hybridization of Hard Computing and Soft Computing

  • Laura Cruz-Reyes
  • Diana Maritza Nieto-Yáñez
  • Pedro Tomás-Solis
  • Guadalupe Castilla Valdez
Part of the Advances in Soft Computing book series (AINSC, volume 44)

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.

Keywords

bin packing problem hard computing soft computing genetic algorithms hybrid intelligent system 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Baase, S.: Computer Algorithms, Introduction to Design and Analysis, Editorial Addison-Wesley Publishing Company, (1998)Google Scholar
  2. 2.
    Falkenauer E.: A Hybrid Grouping Genetic Algorithm for Bin Packing, CRIF — Research Centre for Belgian Metalworking Industry Industrial Management and Automation, (1996)Google Scholar
  3. 3.
    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 2006Google Scholar
  4. 4.
    Ducatelle F.: Ant Colony Optimisation for Bin Packing and Cutting Stock Problems, School of Artificial Intelligence, University of Edinburgh, (2001)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    Martello S., Toth P.: Lower Bounds and Reduction Procedures for the Bin Packing Problem, in Discrete Applied Mathematics, Holland, Elsevier Science Publishers, (1990).Google Scholar
  7. 7.
    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.Google Scholar
  8. 8.
    Martello S., Toth P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley & Sons Ltd. (1990)Google Scholar
  9. 9.
    Beasley—s OR-Library, http://www.ms.ic.ac.uk/info.htmlGoogle Scholar
  10. 10.
    Operational Research Library, http://www.bwl.tu-darmstadt.de/bwl3/forsch/projekte/binppGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Laura Cruz-Reyes
    • 1
  • Diana Maritza Nieto-Yáñez
    • 1
  • Pedro Tomás-Solis
    • 1
  • Guadalupe Castilla Valdez
    • 1
  1. 1.Juventino Rosas y Jesús Urueta C.P.Instituto Tecnológico de Cd. MaderoCd. Madero TamaulipasMéxico

Personalised recommendations