DocumentCode
2325397
Title
Penalty functions and the knapsack problem
Author
Olsen, Anne L.
Author_Institution
Dept. of Comput. Inf. Syst., Wingate Coll., NC, USA
fYear
1994
fDate
27-29 Jun 1994
Firstpage
554
Abstract
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
Keywords
constraint handling; genetic algorithms; operations research; genetic algorithm; knapsack problem; penalty functions; search space; solution space; zero-one knapsack problem; Constraint optimization; Decoding; Educational institutions; Evolutionary computation; Genetic algorithms; Information systems; Law; NP-complete problem; Terminology; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 1994. IEEE World Congress on Computational Intelligence., Proceedings of the First IEEE Conference on
Conference_Location
Orlando, FL
Print_ISBN
0-7803-1899-4
Type
conf
DOI
10.1109/ICEC.1994.350000
Filename
350000
Link To Document