Abstract
A series of modifications to the real coded genetic algorithm for the task of locating the global minimum of multidimensional functions are presented here. These modifications include a new stopping rule, a novel mutation mechanism and a periodically application of a local search procedure. The proposed modifications are tested on a series of optimization problems and the results are reported.
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.
