Abstract
Due to dynamic and uncertain nature of many optimization problems in real-world, an algorithm for applying to this environment must be able to track the changing optima over the time continuously. In this paper, we report a novel multi-population particle swarm optimization, which improved its performance by employing an external memory. This algorithm, namely History-Driven Particle Swarm Optimization (HdPSO), uses a BSP tree to store the important information about the landscape during the optimization process. Utilizing this memory, the algorithm can approximate the fitness landscape before actual fitness evaluation for some unsuitable solutions. Furthermore, some new mechanisms are introduced for exclusion and change discovery, which are two of the most important mechanisms for each multi-population optimization algorithm in dynamic environments. The performance of the proposed approach is evaluated on Moving Peaks Benchmark (MPB) and a modified version of it, called MPB with pendulum motion (PMPB). The experimental results and statistical test prove that HdPSO outperforms most of the algorithms in both benchmarks and in different scenarios.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.