English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

The problem of early convergence in the Particle Swarm Optimization (PSO) algorithm often causes the search process to be trapped in a local optimum. This problem often occurs when the diversity of the swarm decreases and the swarm cannot escape from a local optimal. In this paper, a novel dynamic diversity enhancement particle swarm optimization (DDEPSO) algorithm is introduced. In this variant of PSO, we periodically replace some of the swarm's particles by artificial ones, which are generated based on the history of the search process, in order to enhance the diversity of the swarm and promote the exploration ability of the algorithm. Afterwards, we update the velocity of the artificial particles in corresponding generating period by a new velocity equation with the minimum inertia weight in order to enhance the exploitation potentiality of the swarm. The performance of this approach has been tested on the set of twelve standard unimodal and multimodal (Rotated or unrotated) benchmark problems and the results have been compared with our previous work as well as four other variants of the PSO algorithm. The numerical results demonstrate that the proposed algorithm outperforms others in most of the test cases taken in this study

Dynamic Diversity Enhancement in Particle Swarm Optimization (DDEPSO) Algorithm for Preventing from Premature Convergence