arrow
Return

An improved teaching-learning-based optimization algorithm and itsapplication to a combinatorial optimization problem in foundry industry

delete2017-08-01
delete63
PRE
AI
X
Xiaoyuan Ji
Y
Ye Hu
J
Jianxin Zhou *
X
Xu Shen
DOI:10.1016/j.asoc.2017.04.029delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Teaching-learning-based optimization (TLBO) algorithm is a novel nature-inspired algorithm that mimics the teaching and learning process. In this paper, an improved version of TLBO algorithm (I-TLBO) is investigated to enhance the performance of original TLBO by achieving a balance between exploitation and exploration ability. Inspired by the concept of historical population, two new phases, namely self feedback learning phase as well as mutation and crossover phase, are introduced in I-TLBO algorithm. In self-feedback learning phase, a learner can improve his result based on the historical experience if his present state is better than the historical state. In mutation and crossover phase, the learners update their positions with probability based on the new population obtained by the crossover and mutation operations between present population and historical population. The design of self-feedback learning phase seeks the maintaining of good exploitation ability while the introduction of the mutation and crossover phase aims at the improvement of exploration ability in original TLBO. The effectiveness of proposed I-TLBO algorithm is tested on some benchmark functions and a combinatorial optimization problem of heat treating in foundry industry. The comparative results with some other improved TLBO algorithms and classic algorithms show that I-TLBO algorithm has significant advantages due to the balance between exploitation and exploration ability. (C) 2017 Elsevier B.V. All rights reserved.
Keywords:
Teaching-learning-based optimization
Historical population
Self-feedback learning
Mutation and crossover
Combinatorial optimization
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Applied Soft Computing cover
Applied Soft Computing
IF:
6.6
Papers:
1.4W
Citations:
4.8W

Organization

No organization information available