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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
