Effectiveness of penalty function in solving the subset sum problem
Open Access
- 1 January 1996
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 422-425
- https://doi.org/10.1109/icec.1996.542401
Abstract
We investigate the evolutionary heuristics used as approximation algorithm to the subset sum problem. We propose a graded penalty function in a fitness function of genetic algorithms to penalize an infeasible string in solving the subset sum problem. An exponential term of generation variable, t/sup 0/, is added into the penalty function for increasing penalty generation by generation. The experiments show that the proposed penalty function is more efficient, than other existing penalty functions. It is suggested that the penalty pressure is increased step by step.Keywords
This publication has 3 references indexed in Scilit:
- Using a genetic algorithm to optimize problems with feasibility constraintsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Penalty functions and the knapsack problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GA'sPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002