An Efficient Multi-core Implementation of the Jaya Optimisation Algorithm
Panagiotis D. Michailidis

TL;DR
This paper introduces HHCPJaya, a hybrid parallel algorithm for multi-core systems that enhances large-scale global optimization by combining hyper-population and hierarchical cooperation, improving solution quality and convergence speed.
Contribution
It presents a novel hybrid parallel algorithm, HHCPJaya, integrating hyper-population and hierarchical cooperation for efficient multi-core global optimization.
Findings
Demonstrates improved solution quality and convergence rate.
Requires relatively low computational effort for large-scale problems.
Proves effectiveness across different experimental settings.
Abstract
In this work, we propose a hybrid parallel Jaya optimisation algorithm for a multi-core environment with the aim of solving large-scale global optimisation problems. The proposed algorithm is called HHCPJaya, and combines the hyper-population approach with the hierarchical cooperation search mechanism. The HHCPJaya algorithm divides the population into many small subpopulations, each of which focuses on a distinct block of the original population dimensions. In the hyper-population approach, we increase the small subpopulations by assigning more than one subpopulation to each core, and each subpopulation evolves independently to enhance the explorative and exploitative nature of the population. We combine this hyper-population approach with the two-level hierarchical cooperative search scheme to find global solutions from all subpopulations. Furthermore, we incorporate an additional…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
