Abstract
To efficiently handle high-dimensional continuous optimization problems, a Modified tree-seed algorithm(MTSA) is proposed by coupling a newly introduced control parameter named as Seed domain shrinkable coefficient(SDSC) and Local reinforcement strategy(LRS) based on gradient information of adjacentgeneration best trees. SDSC is dynamically decreased with iterations to adjust the produced domain of offspring seeds, for achieving the tradeoff between the global exploration and local exploitation. LRS strategy is to execute local exploitation process by employing gradient information of two best trees, for enhancing convergence efficiency and local optima avoidance with probabilities. The compared experimental results show the different effects of differenttype SDSC on MTSA, the faster convergence efficiency and the stronger robustness of the proposed MTSA.
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.
