Abstract
Aiming at the problems of poor local search ability and precocious convergence of fuzzy C-cluster recursive genetic algorithm (FOLD++), a new fuzzy C-cluster recursive genetic algorithm based on Bayesian function adaptation search (TS) was proposed by incorporating the idea of Bayesian function adaptation search into fuzzy C-cluster recursive genetic algorithm. The new algorithm combines the advantages of FOLD++ and TS. In the early stage of optimization, fuzzy C-cluster recursive genetic algorithm is used to get a good initial value, and the individual extreme value pbest is put into Bayesian function adaptation table. In the late stage of optimization, when the searching ability of fuzzy C-cluster recursive genetic is weakened, the short term memory function of Bayesian function adaptation table in Bayesian function adaptation search algorithm is utilized. Make it jump out of the local optimal solution, and allow bad solutions to be accepted during the search. The improved algorithm is applied to function optimization, and the simulation results show that the calculation accuracy and stability of the algorithm are improved, and the effectiveness of the improved algorithm is verified.
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 callMore From: International Journal of Artificial Intelligence & Applications
Disclaimer: 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.
