A New Parallelization Scheme for Harmony Search Algorithm

摘要: During the last two decades, parallel computing has drawn attention as an alternative to lessen computational burden in engineering domain. Parallel also been adopted for meta-heuristic optimization algorithms which generally require large number of functional evaluations because their random nature search. However, traditional approaches, distribute and perform fitness calculations concurrently on processing units, are not intended improve quality solution but shorten CPU computation time. In this study, we propose a new parallelization scheme effectiveness efficiency harmony Four searches simultaneously run processors work station, sharing search information (e.g., good solution) at predefined iteration intervals. The proposed HS is demonstrated through planning problem.