Abstract

AbstractTeaching learning‐based optimization (TLBO) was proposed by Rao to solve optimization problems. It is based on the theory of teaching‐learning mechanism. Although it performs well in unimodal problems yet its performance is not good in multimodal problems. To further improve this algorithm's performance and make it suitable for both unimodal problems and multimodal problems, we made some major changes in the theory and the algorithm's operators. The proposed algorithm is able to capture diverse optimal solutions in less number of iterations and is very good for solving multimodal problems. This newly created variant of TLBO is named generalized TLBO (GTLBO). The performance of GTLBO is tested on CEC−06, 2019 benchmark functions and other 15 classical benchmark functions, and it is found that the proposed algorithm is performing better comparatively. Then it is simulated for solving the workflow scheduling problem in CloudSim. Standard scientific workflow applications as Montage, Epigenomics, Sipht, and a sample workflow are used as dataset to test algorithms' performance in cloud environments. Our proposed approach, GTLBO, provides the proper distribution of workloads and offers minimal execution‐cost for the workflow applications. Results reflect the supremacy of the proposed algorithm GTLBO comparatively.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.