On the Feasibility Problem of Penalty-Based Evolutionary Algorithms for Knapsack Problems

  • Jens Gottlieb
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2037)


Constrained optimization problems can be tackled by evolutionary algorithms using penalty functions to guide the search towards feasibility. The core of such approaches is the design of adequate penalty functions. All authors, who designed penalties for knapsack problems, recognized the feasibility problem, i.e. the final population contains unfeasible solutions only. In contrast to previous work, this paper explains the origin of the feasibility problem. Using the concept of fitness segments, a computationally easy analysis of the fitness landscape is suggested. We investigate the effects of the initialization routine, and derive guidelines that ensure resolving the feasibility problem. A new penalty function is proposed that reliably leads to a final population containing feasible solutions, independently of the initialization method employed.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    J.T. Richardson, M.R. Palmer, G. Liepins, and M. Hilliard. Some Guidelines for Genetic Algorithms with Penalty Functions. In Proc. 3rd International Conference on Genetic Algorithms, 191–197, Morgan Kaufmann, 1989Google Scholar
  2. 2.
    S. Khuri and A. Batarekh. Heuristics for the Integer Knapsack Problem. In Proc. 10th International Computer Science Conference, 161–172, Santiago, Chile, 1990Google Scholar
  3. 3.
    J. Thiel and S. Voss. Some Experiences on Solving Multiconstraint Zero-One Knapsack Problems with Genetic Algorithms. INFOR, Volume 32,No. 4, 226–242, 1994zbMATHGoogle Scholar
  4. 4.
    Z. Michalewicz and J. Arabas. Genetic Algorithms for the 0/1_Knapsack Problem. In Proc. 8th International Symposium on Methodologies for Intelligent Systems, 134–143, Springer, 1994Google Scholar
  5. 5.
    A.L. Olsen. Penalty functions and the knapsack problem. In Proc. 1st IEEE Conference on Evolutionary Computation, 554–558, 1994Google Scholar
  6. 6.
    R. Hinterding. Representation, Constraint Satisfaction and the Knapsack Problem. In Proc. Congress on Evolutionary Computation, 1286–1292, Washington DC, 1999Google Scholar
  7. 7.
    S. Khuri, T. Bäck, and J. Heitkötter. The Zero/One Multiple Knapsack Problem and Genetic Algorithms. In Proc. ACM Symposium on Applied Computation, 188–193, ACM Press, 1994Google Scholar
  8. 8.
    J. Gottlieb. Evolutionary Algorithms for Constrained Optimization Problems. Dissertation, Technical University of Clausthal, 1999. Shaker, Aachen, 2000Google Scholar
  9. 9.
    P.C. Chu and J.E. Beasley. A Genetic Algorithm for the Multidimensional Knapsack Problem. Journal of Heuristics, Volume 4,No. 1, 63–86, 1998CrossRefzbMATHGoogle Scholar
  10. 10.
    S. Martello and P. Toth. Knapsack Problems. John Wiley & Sons, 1990Google Scholar
  11. 11.
    S. Khuri, T. Bäck, and J. Heitkötter. An Evolutionary Approach to Combinatorial Optimization Problems. In Proc. 22nd Annual ACM Computer Science Conference, 66–73, ACM Press, New York, 1994Google Scholar
  12. 12.
    F. Corno, M. Sonza Reorda, and G. Squillero. The Selfish Gene Algorithm: A New Evolutionary Optimization Strategy. In Proc. 13th Annual ACM Symposium on Applied Computing. 1998Google Scholar
  13. 13.
    H.A. Mayer. ptGAs-Genetic Algorithms Evolving Noncoding Segments by Means of Promoter/Terminator Sequences. Evolutionary Computation, Volume 6,No. 4, 361–386, 1998MathSciNetCrossRefGoogle Scholar
  14. 14.
    G. Rudolph and J. Sprave. A Cellular Genetic Algorithm with Self-Adjusting Acceptance Threshold. In Proc. 1st IEE/IEEE International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications, 365–372, IEE, London, 1995Google Scholar
  15. 15.
    G. Rudolph and J. Sprave. Significance of Locality and Selection Pressure in the Grand Deluge Evolutionary Algorithm. In Proc. 4th Conference on Parallel Problem Solving from Nature, 686–695, Springer, 1996Google Scholar
  16. 16.
    A. Hoff, A. Løkketangen, and I. Mittet. Genetic Algorithms for 0/1 Multidimensional Knapsack Problems. In Proc. Norsk Informatikk Konferanse, 1996Google Scholar
  17. 17.
    A. Løkketangen. A Comparison of a Genetic Algorithm and a Tabu Search Method for 0/1 Multidimensional Knapsack Problems. In Proc. Nordic Operations Research Conference, 1995Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Jens Gottlieb
    • 1
  1. 1.SAP AGWalldorfGermany

Personalised recommendations