Master-Slave TLBO Algorithm for Constrained Global Optimization Problems

Authors

DOI:

https://doi.org/10.4108/eai.26-5-2020.166292

Keywords:

Master-slave TLBO algorithm, Parallel Evolutionary Algorithms, GPGPU, Constrained benchmark functions, Optimization problems

Abstract

INTRODUCTION: The teaching-learning based optimization (TLBO) algorithm is a recently developed algorithm. The proposed work presents a design of a master-slave TLBO algorithm. OBJECTIVES: This research aims to design a master-slave TLBO algorithm to improve its performance and system utilization for CEC2006 single-objective benchmark functions. METHODS: The proposed approach implemented using OpenMP and CUDA C, a hybrid programming approach to enhance the utilization of the system’s computational resources. The device utilization and performance of the proposed approach evaluated using CEC2006 benchmark functions. RESULTS: The proposed approach obtains best results in significantly reduced time for CEC2006 benchmark functions. The maximum speed-up achieved is 30.14X. The average GPGPU utilization is 90% and the average utilization of logical processors is more than 90%. CONCLUSION: The master-slave TLBO algorithm improves the utilization of computational resources significantly and obtains the best results for CEC2006 benchmark functions.

Downloads

Published

09-09-2020

How to Cite

1.
Mane SU, Adamuthe AC, Omane RR. Master-Slave TLBO Algorithm for Constrained Global Optimization Problems. EAI Endorsed Scal Inf Syst [Internet]. 2020 Sep. 9 [cited 2024 Nov. 13];8(30):e2. Available from: https://publications.eai.eu/index.php/sis/article/view/2080