A Hybrid Genetic Algorithm for the 0–1 Multiple Knapsack Problem

  • C. Cotta
  • J. M. Troya


A hybrid genetic algorithm based in local search is described. Local optimisation is not explicitly performed but it is embedded in the exploration of a search metaspace. This algorithm is applied to a NP-hard problem. When it is compared with other GA-based approaches and an exact technique (a branch and bound algorithm), this algorithm exhibits a better overall performance in both cases. Then, a coarse-grain parallel version is tested, yielding notably improved results.


Genetic Algorithm Local Search Problem Instance Knapsack Problem Hybrid Genetic Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    J.E. Beasley. OR-library: Distributing test problems by electronic mail. Journal of Operational Research Society, 41(11):1069–1072, 1990.Google Scholar
  2. [2]
    A. Chipperfield and P. Fleming. Parallel Genetic Algorithms, pages 1118–1143. McGraw-Hill Series on Computing Engineering, 1996.Google Scholar
  3. [3]
    L. Davis, editor. Handbook of Genetic Algorithms. Van Nostrand Reinhold Computer Library, NY, 1991.Google Scholar
  4. [4]
    M. Garey and D. Johnson. Computers and intractability: A guide to the theory of NP-Completeness. Freeman and Co., San Francisco, 1979.MATHGoogle Scholar
  5. [5]
    E. Horowitz and S. Sahni. Fundamentals of Computer Algorithms. Computer Science Press, 1978.Google Scholar
  6. [6]
    S. Khuri, T. Baeck, and J. Heitkotter. The zero/one multiple knapsack problem and genetic algorithms. In Proceedings of the ACM Symposium of Applied Computation. ACM Press, 1993.Google Scholar
  7. [7]
    H. Muehlenbein. Parallel genetic algorithm, population dynamics and combinatorial optimization. In Proceedings of the Third International Conference on Genetic Algorithms, pages 416–421, San Mateo, 1989. Morgan Kaufmann.Google Scholar
  8. [8]
    C. Peterson and B. Södeberg. Artificial neural networks. In Modern heuristic techniques for combinatorial problems. C.R. Reeves editor, Advanced Topics in Computer Science, pages 197–242, 1993, Oxford Scientific Publications.Google Scholar
  9. [9]
    N.J. Radcliffe. Forma analysis and random respectful recombination. In Proceedings of the Fourth International Conference on Genetic Algorithms, pages 222–229, San Mateo CA, 1991. Morgan Kaufmann.Google Scholar
  10. [10]
    I. Rechember. Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Frommann-Holzboog Verlag, Stuttgart, 1973.Google Scholar
  11. [11]
    R.H. Storer, S.D. Wu, and R. Vaccari. New search spaces for sequencing problems with application to job shop scheduling. Management Science, 38:1495–1509, 1992.MATHCrossRefGoogle Scholar
  12. [12]
    W.L. Winston. Operations Research. Applications and algorithms. Duxbury Press, Belmont CA, 1993.Google Scholar
  13. [13]
    D.H. Wolpert and W.G. Macready. No free lunch theorems for search. Technical Report SFI-TR-95-02-010, Sante Fe Institute, 1995.Google Scholar

Copyright information

© Springer-Verlag Wien 1998

Authors and Affiliations

  • C. Cotta
    • 1
  • J. M. Troya
    • 1
  1. 1.Departamento de Lenguajes y Ciencias de la ComputaciónMálagaSpain

Personalised recommendations