Advertisement

Journal of Heuristics

, Volume 2, Issue 1, pp 5–30 | Cite as

A hybrid grouping genetic algorithm for bin packing

  • Emanuel Falkenauer
Article

Abstract

The grouping genetic algorithm (GGA) is a genetic algorithm heavily modified to suit the structure of grouping problems. Those are the problems where the aim is to find a good partition of a set or to group together the members of the set. The bin packing problem (BPP) is a well known NP-hard grouping problem: items of various sizes have to be grouped inside bins of fixed capacity. On the other hand, the reduction method of Martello and Toth, based on their dominance criterion, constitutes one of the best OR techniques for optimization of the BPP to date.

In this article, we first describe the GGA paradigm as compared to the classic Holland-style GA and the ordering GA. We then show how the bin packing GGA can be enhanced with a local optimization inspired by the dominance criterion. An extensive experimental comparison shows that the combination yields an algorithm superior to either of its components.

Key Words

grouping partitioning bin packing genetic algorithm solution encoding dominance reduction 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. BelewRichard K., and LashonB. Booker (Eds.). (1991). Proceedings of the Fourth International Conference on Genetic Algorithms. University of California, San Diego, July 13–16. San Mateo, CA: Morgan Kaufmann.Google Scholar
  2. BhuyanJay N., VijayV. Raghavan, and VenkateshK. Elayavalli. (1991). “Genetic Algorithm for Clustering with an Ordered Representation”. In R.Belew and L.Booker (Eds.), Proceedings of the Fourth International Conference on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann.Google Scholar
  3. DavisLawrence (Ed.). (1991). Handbook of Genetic Algorithms. New York: Van Nostrand Reinhold.Google Scholar
  4. DingH., A.A.El-Keib, and R.E.Smith. (1992). Optimal Clustering of Power Networks Using Genetic Algorithms. TCGA Report No. 92001, March 5, University of Alabama, Tuscaloosa, AL.Google Scholar
  5. FalkenauerEmanuel. (1993). “The Grouping Genetic Algorithms: Widening the Scope of the GAs.” JORBEL: Belgian Journal of Operations Research, Statistics and Computer Science 33(1,2), 79–102.Google Scholar
  6. FalkenauerEmanuel. (1994). “New Representation and Operators for GAs Applied to Grouping Problems.” Evolutionary Computation 2(2), 123–144.Google Scholar
  7. FalkenauerEmanuel. (1995). “Solving Equal Piles with a Grouping Genetic Algorithm.” In L.J.Eshelman (Ed.), Proceedings of the Sixth International Conference on Genetic Algorithms (pp. 492–497). San Francisco: Morgan Kaufmann.Google Scholar
  8. Falkenauer, Emanuel, and Alain Delchambre. (1992). “A Genetic Algorithm for Bin Packing and Line Balancing.” In Proceedings of the IEEE 1992 International Conference on Robotics and Automation (RA92), May 10–15, Nice, France.Google Scholar
  9. GareyMichael R., and David S.Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: Freeman.Google Scholar
  10. GoldbergDavid E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Reading, MA: Addison-Wesley.Google Scholar
  11. GoldbergDavid E., DebKalyanmoy, and BradleyKorb. (1991). “Don't Worry, Be Messy.” In R.Belew and L.Booker (Eds.), Proceedings of the Fourth International Conference on Genetic Algorithms. University of California, San Diego, July 13–16. San Mateo, CA: Morgan Kaufmann.Google Scholar
  12. GrefenstetteJohn J. (Ed.). (1985). Proceedings of the First International Conference on Genetic Algorithms and Their Applications. Carnegie-Mellon University, Pittsburgh, PA, July 24–26. Hillsdale, NJ: Erlbaum.Google Scholar
  13. Hinterding, Robert, and Lutfar Khan. (1994). “Genetic Algorithms for Cutting Stock Problems: With and Without Contiguity.” Paper accepted by the Australian AI'94 Workshop on Evolutionary Computation.Google Scholar
  14. HollandJohn H. (1975). Adaptation in Natural and Artificial Systems. Ann Arbor, MI: University of Michigan Press.Google Scholar
  15. JonesDonald R., and Mark A.Beltramo. (1991). “Solving Partitioning Problems with Genetic Algorithms.” In R.Belew and L.Booker (Eds.), Proceedings of the Fourth International Conference on Genetic Algorithms. University of California, San Diego, July 13–16. San Mateo, CA: Morgan Kaufmann.Google Scholar
  16. Männer, Reinhard, and Bernard Manderick (Eds.). (1992). “Parallel Problem Solving from Nature, 2.” Proceedings of the Second Conference on Parallel Problem Solving from Nature (PPSN2), Brussels, Belgium, September 28–30.Google Scholar
  17. MartelloSilvano, and PaoloToth. (1990a). “Lower Bounds and Reduction Procedures for the Bin Packing Problem.” Discrete Applied Mathematics 22, 59–70.Google Scholar
  18. MartelloSilvano, and PaoloToth. (1990b). “Bin-Packing Problem”. In Knapsack Problems, Algorithms and Computer Implementations (pp. 221–245). City. Wiley.Google Scholar
  19. RadcliffeNicholas J. (1991). “Forma Analysis and Random Respectful Recombination.” In R.Belew and L.Booker (Eds.), Proceedings of the Fourth International Conference on Genetic Algorithms. University of California, San Diego, July 13–16. San Mateo, CA: Morgan Kaufmann.Google Scholar
  20. Radcliffe, Nicholas. (1992). “Non-Linear Genetic Representations.” In R. Männer and B. Manderick (Eds.), Proceedings of the Second Conference on Parallel Problem Solving from Nature (PPSN2), Brussels, Belgium, September 28–30.Google Scholar
  21. Reeves, Colin. (1995). “Hybrid Genetic Algorithms for Bin-Packing and Related Problems.” Working paper, submitted to Annals of OR Metaheuristics in Combinatorial Optimization.Google Scholar
  22. SmithDerek. (1985). “Bin Packing with Adaptive Search.” In J.Grefenstette (Ed.), Proceedings of the First International Conference on Genetic Algorithms and Their Applications. Carnegie-Mellon University, Pittsburgh, PA, July 24–26. Hillsdale, NJ: Erlbaum.Google Scholar
  23. SyswerdaGilbert. (1989). “Uniform Crossover in Genetic Algorithms.” In D.J.Schaffer (Ed.), Proceedings of the Third International Conference on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann.Google Scholar
  24. Van Driessche, Raf, and Robert Plessens. (1992). “Load Balancing with Genetic Algorithms.” In R. Männer and B. Manderick (Eds.), Proceedings of the Second Conference on Parallel Problem Solving from Nature (PPSN2), Brussels, Belgium, September 28–30.Google Scholar
  25. Van Vliet, André. (1993). Econometric Institute, Erasmus University Rotterdam, private communication.Google Scholar
  26. VonLaszewskiGregor. (1991). “Intelligent Structural Operators for the k-way Graph Partitioning Problem.” In R.Belew and L.Booker (Eds.), Proceedings of the Fourth International Conference on Genetic Algorithms. University of California, San Diego, July 13–16. San Mateo, CA: Morgan Kaufmann.Google Scholar
  27. VoseMichael D., and GunarE. Liepins. (1991). “Schema Disruption.” In R.Belew and L.Booker (Eds.), Proceedings of the Fourth International Conference on Genetic Algorithms. University of California, San Diego, July 13–16. San Mateo, CA: Morgan Kaufmann.Google Scholar

Copyright information

© Kluwer Academic Publishers 1996

Authors and Affiliations

  • Emanuel Falkenauer
    • 1
  1. 1.Industrial Management and AutomationResearch Centre for the Belgian Metalworking Industry (CRIF)BrusselsBelgium

Personalised recommendations