Next Article in Journal
A Source Domain Extension Method for Inductive Transfer Learning Based on Flipping Output
Previous Article in Journal
Power Control and Channel Allocation Algorithm for Energy Harvesting D2D Communications
Article Menu
Issue 5 (May) cover image

Export Article

Open AccessArticle

A Cyclical Non-Linear Inertia-Weighted Teaching–Learning-Based Optimization Algorithm

1 and 2,*
1
School of Computer Science, Xianyang Normal University, Xianyang 712000, China
2
School of Information Engineering, Xizang Minzu University, Xianyang 712000, China
*
Author to whom correspondence should be addressed.
Algorithms 2019, 12(5), 94; https://doi.org/10.3390/a12050094
Received: 6 March 2019 / Revised: 17 April 2019 / Accepted: 23 April 2019 / Published: 3 May 2019
  |  
PDF [427 KB, uploaded 3 May 2019]
  |  

Abstract

After the teaching–learning-based optimization (TLBO) algorithm was proposed, many improved algorithms have been presented in recent years, which simulate the teaching–learning phenomenon of a classroom to effectively solve global optimization problems. In this paper, a cyclical non-linear inertia-weighted teaching–learning-based optimization (CNIWTLBO) algorithm is presented. This algorithm introduces a cyclical non-linear inertia weighted factor into the basic TLBO to control the memory rate of learners, and uses a non-linear mutation factor to control the learner’s mutation randomly during the learning process. In order to prove the significant performance of the proposed algorithm, it is tested on some classical benchmark functions and the comparison results are provided against the basic TLBO, some variants of TLBO and some other well-known optimization algorithms. The experimental results show that the proposed algorithm has better global search ability and higher search accuracy than the basic TLBO, some variants of TLBO and some other algorithms as well, and can escape from the local minimum easily, while keeping a faster convergence rate. View Full-Text
Keywords: optimization; teaching–learning-based optimization (TLBO); global optimization; swarm intelligent optimization optimization; teaching–learning-based optimization (TLBO); global optimization; swarm intelligent optimization
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Wu, Z.; Xue, R. A Cyclical Non-Linear Inertia-Weighted Teaching–Learning-Based Optimization Algorithm. Algorithms 2019, 12, 94.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top