Search published articles


Showing 5 results for Teaching-Learning-Based Optimization

W. Cheng, F. Liu , L.j. Li,
Volume 3, Issue 3 (9-2013)
Abstract

A novel optimization algorithm named teaching-learning-based optimization (TLBO) algorithm and its implementation procedure were presented in this paper. TLBO is a meta-heuristic method, which simulates the phenomenon in classes. TLBO has two phases: teacher phase and learner phase. Students learn from teachers in teacher phases and obtain knowledge by mutual learning in learner phase. The suitability of TLBO for size and geometry optimization of structures in structural optimal design was tested by three truss examples. Meanwhile, these examples were used as benchmark structures to explore the effectiveness and robustness of TLBO. The results were compared with those of other algorithms. It is found that TLBO has advantages over other optimal algorithms in convergence rate and accuracy when the number of variables is the same. It is much desired for TLBO to be applied to the tasks of optimal design of engineering structures.
M. H. Makiabadi, A. Baghlani, H. Rahnema , M. A. Hadianfard,
Volume 3, Issue 3 (9-2013)
Abstract

In this study, teaching-learning-based optimization (TLBO) algorithm is employed for the first time for optimization of real world truss bridges. The objective function considered is the weight of the structure subjected to design constraints including internal stress within bar elements and serviceability (deflection). Two examples demonstrate the effectiveness of TLBO algorithm in optimization of such structures. Various design groups have been considered for each problem and the results are compared. Both tensile and compressive stresses are taken into account. The results show that TLBO has a great intrinsic capability in problems involving nonlinear design criteria.
A. Kaveh, K. Biabani Hamedani,
Volume 10, Issue 1 (1-2020)
Abstract

The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for embedding graphs in the plane. The algorithms consist of Artificial Bee Colony algorithm, Big Bang-Big Crunch algorithm, Teaching-Learning-Based Optimization algorithm, Cuckoo Search algorithm, Charged System Search algorithm, Tug of War Optimization algorithm, Water Evaporation Optimization algorithm, and Vibrating Particles System algorithm. The performance of the utilized algorithms is investigated through various examples including six complete graphs and eight complete bipartite graphs. Convergence histories of the algorithms are provided to better understanding of their performance. In addition, optimum results at different stages of the optimization process are extracted to enable to compare the meta-heuristics algorithms.
M. Shahrouzi, A. Salehi,
Volume 10, Issue 1 (1-2020)
Abstract

Imperialist Competitive Algorithm, ICA is a meta-heuristic which simulates collapse of weak empires by more powerful ones that take possession of their colonies. In order to enhance performance, ICA is hybridized with proper features of Teaching-Learning-Based Optimization, TLBO. In addition, ICA walks are modified with an extra term to intensify looking for the global best solution. The number of control parameters and consequent tuning effort has been reduced in the proposed Imperialist Competitive Learner-Based Optimization, ICLBO with respect to ICA and several other methods. Efficiency and effectiveness of ICLBO is further evaluated treating a number of test functions in addition to continuous and discrete engineering problems. It is discussed and traced that balancing between exploration and exploitation is enhanced due to the proposed hybridization. Numerical results exhibit superior performance of ICLBO vs. ICA and a variety of other well-known meta-heuristics.
A. Kaveh, K. Biabani Hamedani, F. Barzinpour,
Volume 10, Issue 2 (4-2020)
Abstract

Meta-heuristic algorithms are applied in optimization problems in a variety of fields, including engineering, economics, and computer science. In this paper, seven population-based meta-heuristic algorithms are employed for size and geometry optimization of truss structures. These algorithms consist of the Artificial Bee Colony algorithm, Cyclical Parthenogenesis Algorithm, Cuckoo Search algorithm, Teaching-Learning-Based Optimization algorithm, Vibrating Particles System algorithm, Water Evaporation Optimization, and a hybridized ABC-TLBO algorithm. The Taguchi method is employed to tune the parameters of the meta-heuristics. Optimization aims to minimize the weight of truss structures while satisfying some constraints on their natural frequencies. The capability and robustness of the algorithms is investigated through four well-known benchmark truss structure examples.

Page 1 from 1     

© 2020 All Rights Reserved | Iran University of Science & Technology

Designed & Developed by : Yektaweb