Abstract
In this paper, a hybrid genetic algorithm for solving constrained optimization problems is addressed. First, a real-coded genetic algorithm is presented. The simplified quadratic interpolation method is then integrated into the genetic algorithm to improve its local search ability and the accuracy of the minimum function value. Simulation results on 13 benchmark problems show that the proposed hybrid algorithm is able to avoid the premature convergence and find much better solutions with high speed compared to other existing algorithms.
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.
