Improved version of teaching learning-based optimization algorithm using random local search

Purpose This paper aims to deal with the development of a newly improved version of teaching learning based optimization (TLBO) algorithm. Design/methodology/approach Random local search part was added to the classic optimization process with TLBO. The new version is called TLBO algorithm with rando...

Full description

Saved in:
Bibliographic Details
Published in:Compel 2019-06, Vol.38 (3), p.1048-1060
Main Authors: Kheireddine, Bourahla, Zoubida, Belli, Tarik, Hacib
Format: Article
Language:English
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Purpose This paper aims to deal with the development of a newly improved version of teaching learning based optimization (TLBO) algorithm. Design/methodology/approach Random local search part was added to the classic optimization process with TLBO. The new version is called TLBO algorithm with random local search (TLBO-RLS). Findings At first step and to validate the effectiveness of the new proposed version of the TLBO algorithm, it was applied to a set of two standard benchmark problems. After, it was used jointly with two-dimensional non-linear finite element method to solve the TEAM workshop problem 25, where the results were compared with those resulting from classical TLBO, bat algorithm, hybrid TLBO, Nelder–Mead simplex method and other referenced work. Originality value New TLBO-RLS proposed algorithm contains a part of random local search, which allows good exploitation of the solution space. Therefore, TLBO-RLS provides better solution quality than classic TLBO.
ISSN:0332-1649
2054-5606
DOI:10.1108/COMPEL-09-2018-0373