Abstract
The genetic search can be modeled as a controlled Markovian process, the transition of which depends on control parameters (probabilities of crossover and mutation). This paper proposes a stochastic gradient and develops a stochastic approximation algorithm to optimize control parameters of genetic algorithms (GAs). The optimal values of control parameters can be found from a recursive estimation of control parameters provided by the stochastic approximation algorithm. The algorithm performs in finding a stochastic gradient of a given performance index and adapting the control parameters in the direction of descent. Numerical results based on the classical multimodal functions are given to show the effectiveness of the proposed algorithm.
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.
