PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
August 17, 2019Knowledge-Based Systems182 citationsOpen Access

Dynamic opposite learning enhanced teaching–learning-based optimization

View Full Paper
YXYunlang XuZYZhile YangXLXiaoping Li

Key Points

Key points are not available for this paper at this time.

Abstract

The teaching–learning-based optimization (TLBO) algorithm has been one of most popular bio-inspired meta-heuristic algorithms due to the competitive converging speed and high accuracy. A batch of TLBO variants has been proposed to enhance the exploitation ability and accelerate the exploration process. However, they still suffer from premature convergence in solving complex non-linear problems. In the study, a novel TLBO variant named dynamic-opposite learning TLBO (DOLTLBO) is proposed, which employs a new dynamic-opposite learning (DOL) strategy to overcome premature convergence. The search space of DOL has the characteristics of asymmetry and dynamically adjusting along with a random opposite number. The asymmetric search space significantly increase the probability for the population in obtaining the global optimum, which holistically improves the exploitation capability of DOLTLBO. Meanwhile, the dynamically changing characteristic enriches the diversity of the search space, thus enhancing the exploration ability. To validate the proposed DOL operator and DOLTLBO algorithm, shifted and rotated benchmark functions from CEC 2014, multiextremal functions and constrained engineering problems have been experimented upon. Comprehensive numerical results with the comparisons with the state-of-the-art counterparts show that DOLTLBO has significant advantages of converging to the global optimum on most benchmarks and engineering problems, which also validates the superiority of the novel DOL operator.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Xu et al. (2019) studied this question.

synapsesocial.com/papers/6a5ccc55289a75eadbc238bchttps://doi.org/10.1016/j.knosys.2019.104966
Ask AI
Helpful
Bookmark
Share
View Full Paper