A high-efficient multi-deme genetic algorithm with better load-balance

DOI10.1504/IJCSM.2018.093162MaRDI QIDQ2224284zbMATH OpenWikidataFDO

Authors Wang Jie, Yuan Jiangjun

Publication date 3 February 2021

Published in International Journal of Computing Science and Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/IJCSM.2018.093162

zbMATH Keywords

fine-grained schedulegenetic algorithmload imbalancemulti-deme genetic algorithm (MGA)

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Review text

Summary: Genetic algorithm is a very powerful search algorithm that fits for many complex situations. However, it is very time consuming, which limits its usage. Previous work which makes use of multi-core systems to parallelise it performs well and gains much attention. This paper introduces that the load-imbalance problem in parallel genetic algorithm will incur large overhead and will limit the performance. We propose two efficient mechanisms (postponed waiting and work stealing) to achieve fine-grained schedule to solve the problem. Compared with traditional multi-deme parallel genetic algorithm, our high-efficient multi-deme genetic algorithm (HMGA) can achieve an average speedup of 1.36.

Recommendations

• Efficient parallel genetic algorithms: Theory and practice
• Scalable parallel genetic algorithms
• scientific article; zbMATH DE number 1550514
• scientific article; zbMATH DE number 5258153
• scientific article; zbMATH DE number 1501196

Cited in

(2)

• Load balancing strategy based on immune genetic algorithm
• A Distributed Hybrid Heuristics of Mean Field Annealing and Genetic Algorithm for Load Balancing Problem

This page was built for publication: A high-efficient multi-deme genetic algorithm with better load-balance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2224284)