论文信息 - Penalty functions and the knapsack problem

Penalty functions and the knapsack problem

This paper reports on a study of the effectiveness of penalty functions used with a standard genetic algorithm to solve a problem with constraints. Twelve different penalty functions were created and tested using a genetic algorithm to solve the zero-one knapsack problem. In addition to a comparison of the penalty functions, the relationship between the size of the solution space and the size of the search space was also considered.<<ETX>>

Anne L. Olsen

[1] Zbigniew Michalewicz,et al. Handling Constraints in Genetic Algorithms , 1991, ICGA.

[2] Kenneth A. De Jong,et al. Genetic algorithms: A 10 Year Perspective , 1985, ICGA.

[3] D. E. Goldberg,et al. Genetic Algorithms in Search , 1989 .

[4] Lawrence. Davis,et al. Handbook Of Genetic Algorithms , 1990 .

[5] David E. Goldberg,et al. Zen and the Art of Genetic Algorithms , 1989, ICGA.

[6] Zbigniew Michalewicz,et al. Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[7] Zbigniew Michalewicz,et al. A Nonstandard Genetic Algorithm for the Nonlinear Transportation Problem , 1991, INFORMS J. Comput..

[8] Niklaus Wirth,et al. Algorithms + Data Structures = Programs , 1976 .

[9] T. Ibaraki,et al. THE MULTIPLE-CHOICE KNAPSACK PROBLEM , 1978 .

[10] Peter Norvig,et al. Artificial Intelligence: A Modern Approach , 1995 .

[11] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[12] Lawrence Davis,et al. Genetic Algorithms and Simulated Annealing , 1987 .

[13] Dirk Van Gucht,et al. Parallelisation of Probabilistic Sequential Search Algorithms , 1987, ICGA.

[14] Zbigniew Michalewicz,et al. A specialized genetic algorithm for numerical optimization problems , 1990, [1990] Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence.