Abstract
Penalty function is one of the most commonly used method in genetic algorithm(GA) to solve nonlinear constraint optimization problems.For traditional penalty functions,it is always not easy to control penalty factors.In this paper we present a new adaptive penalty function with simpler construction and prove its convergence.Then based on this adaptive penalty function we present a new genetic algorithm,which can make populations quickly access to feasible regions and improve local search capacity of genetic algorithms.Theoretical analysis and simulation results show that this algorithm has stronger stability and better convergence but needs less parameters than other ones.
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.
