Skip to main content
SpringerLink
Log in

Hybrid genetic algorithms for bin-packing and related problems

  • Genetic Algorithms
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

The genetic algorithm (GA) paradigm has attracted considerable attention as a promising heuristic approach for solving optimization problems. Much of the development has related to problems of optimizing functions of continuous variables, but recently there have been several applications to problems of a combinatorial nature. What is often found is that GAs have fairly poor performance for combinatorial problems if implemented in a naive way, and most reported work has involved somewhat ad hoc adjustments to the basic method. In this paper, we will describe a general approach which promises good performance for a fairly extensive class of problems by hybridizing the GA with existing simple heuristics. The procedure will be illustrated mainly in relation to the problem ofbin-packing, but it could be extended to other problems such asgraph partitioning, parallel-machine scheduling andgeneralized assignment. The method is further extended by usingproblem size reduction hybrids. Some results of numerical experiments will be presented which attempt to identify those circumstances in which these heuristics will perform well relative to exact methods. Finally, we discuss some general issues involving hybridization: in particular, we raise the possibility of blending GAs with orthodox mathematical programming procedures.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R.M. Karp, Reducibility among combinatorial problems, in:Complexity of Computer Computations, ed. R.E. Miller and J.W. Thatcher (Plenum Press, New York, 1972).

    Google Scholar 

  2. M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979).

    Google Scholar 

  3. C.R. Reeves,Modern Heuristic Techniques for Combinatorial Problems (Blackwell Scientific, Oxford, 1993).

    Google Scholar 

  4. D.E. Goldberg and R. Lingle, Alleles, loci and the travelling salesman problem, in [32] (1985).

    Google Scholar 

  5. J.J. Grefenstette, Incorporating problem-specific knowledge into genetic algorithms, in:Genetic Algorithms and Simulated Annealing, ed. L. Davis (Morgan Kaufmann, Los Altos, CA, 1987).

    Google Scholar 

  6. I.M. Oliver, D.J. Smith and J.R.C. Holland, A study of permutation crossover operators on the traveling salesman problem, in:Proc. 2nd Int. Conf. on Genetic Algorithims, ed. J.J. Grefenstette (Lawrence Erlbaum, Hillsdale, NJ, 1987).

    Google Scholar 

  7. D. Whitley, T. Starkweather and D. Shaner, The traveling salesman and sequence scheduling: Quality solutions using genetic edge recombination, in [36] (1991).

    Google Scholar 

  8. G.A. Cleveland and S.F. Smith, Using genetic algorithms to schedule flow shop releases, in [33] (1989).

    Google Scholar 

  9. C.R. Reeves, A genetic algorithm for flowshop sequencing, Comp. Oper. Res. 22(1995)5–13.

    Article  Google Scholar 

  10. J.T. Richardson, M.R. Palmer, G.E. Liepins and M.R. Hillyard, Some guidelines for genetic algorithms with penalty functions, in [33] (1989).

    Google Scholar 

  11. A. Kapsalis, V.J. Rayward-Smith and G.D. Smith, Solving the graphical Steiner tree problem using genetic algorithms, J. Oper. Res. Soc. 41(1993)397–406.

    Google Scholar 

  12. P. Prosser, A hybrid genetic algorithm for pallet loading, in:Proc. 8th European Conf. on Artificial Intelligence (Pitman, London, 1988).

    Google Scholar 

  13. E. Falkenauer and A. Delchambre, A genetic algorithm for bin packing and line balancing, in:Proc. IEEE Int. Conf. on Robotics and Automation (1992).

  14. D.E. Goldberg,Genetic Algorithms in Search, Optimization, and Machine Learning (Addison-Wesley, Reading, MA, 1989).

    Google Scholar 

  15. J.H. Holland,Adaptation in Natural and Artificial Systems (University of Michigan Press, Ann Arbor, 1975).

    Google Scholar 

  16. C.R. Reeves, Genetic algorithms and combinatorial optimization, in:Applications of Modern Heuristic Techniques, ed. V.J. Rayward-Smith (Alfred Waller, Henley-on-Thames, UK, 1994).

    Google Scholar 

  17. D. Smith, Bin packing with adaptive search, in [32] (1985).

    Google Scholar 

  18. B.R. Fox and M.B. McMahon, Genetic operators for sequencing problems, in:Foundations of Genetic Algorithms, ed. G.J.E. Rawlins (Morgan Kaufmann, San Mateo, CA, 1991).

    Google Scholar 

  19. T. Starkweather, S. McDaniel, K. Mathias, D. Whitley and C. Whitley, A comparison of genetic sequencing operators, in [34]. (1991).

    Google Scholar 

  20. J.N. Bhuyan, V.V. Raghavan and V.K. Elayavalli, Genetic algorithms for clustering with an ordered representation, in [34]. (1991).

    Google Scholar 

  21. J.L. Blanton, Jr. and R.L. Wainwright, Multiple vehicle routing with time and capacity constraints using genetic algorithms, in [35] (1993).

    Google Scholar 

  22. A. Homaifar, S. Guan and G.E. Liepins, A new approach on the travelling salesman problem by genetic algorithms, in [35] (1993).

    Google Scholar 

  23. N.J. Radcliffe, Non-linear genetic representations, in:Parallel Problem-Solving from Nature 2, ed. R. Männer and B. Manderick (Elsevier Science, Amsterdam, 1992).

    Google Scholar 

  24. J. Antonisse, A new interpretation of schema notation that overturns the binary encoding constraint, in [33] (1989) pp. 86–91.

    Google Scholar 

  25. M.D. Vose and G.E. Liepins, Schema disruption, in [34] (1991).

    Google Scholar 

  26. E. Falkenauer, private communication (1992).

  27. R.A. Caruana and J.D. Schaffer, Representation and hidden bias: Gray vs. binary coding for genetic algorithms, in:Proc. 5th Int. Conf. on Machine Learning (Morgan Kaufmann, Los Altos, CA, 1988).

    Google Scholar 

  28. D.R. Jones and M.A. Beltramo, Solving partitioning problems with genetic algorithms, in [34] (1991).

    Google Scholar 

  29. S. Martello and P. Toth,Knapsack Problems: Algorithms and Computer Implementations (Wiley, New York, 1991).

    Google Scholar 

  30. C. Höhn and C.R. Reeves, Using genetic algorithms to solve graph partitioning problems, CTAC Technical Report, Coventry University (1994).

  31. N.J. Radcliffe and P. Surrey, Formal memetic algorithms, in:Evolutionary Computing: AISB Workshop, Leeds, UK, April 1994; Selected Papers, ed. T.C. Fogarty (Springer, Berlin, 1994).

    Google Scholar 

  32. J.J. Grefenstette,Proc. Int. Conf. on Genetic Algorithms and their Applications (Lawrence Erlbaum, Hillsdale, NJ, 1985).

    Google Scholar 

  33. J.D. Schaffer (ed.),Proc. 3rd Int. Conf. on Genetic Algorithms (Morgan Kaufmann, Los Altos, CA, 1989).

    Google Scholar 

  34. R.K. Belew and L.B. Booker (eds.),Proc. 4th Int. Conf. on Genetic Algorithms (Morgan Kaufmann, San Mateo, CA, 1991).

    Google Scholar 

  35. S. Forrest (ed.),Proc. 5th Int. Conf. on Genetic Algorithms (Morgan Kaufmann, San Mateo, CA, 1993).

    Google Scholar 

  36. L. Davis (ed.),Handbook of Genetic Algorithms (Van Nostrand Reinhold, New York, 1991).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematical and Information Sciences, Coventry University, Coventry, UK

    Colin Reeves

Authors
  1. Colin Reeves
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Reeves, C. Hybrid genetic algorithms for bin-packing and related problems. Ann Oper Res 63, 371–396 (1996). https://doi.org/10.1007/BF02125404

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02125404

Keywords

Search

Navigation