Applying GA-PSO-TLBO approach to engineering optimization problems

被引:12
作者
Yun, YoungSu [1 ]
Gen, Mitsuo [2 ]
Erdene, Tserengotov Nomin [1 ]
机构
[1] Chosun Univ, Sch Business Adm, 309 Pilmun Daero, Gwangju 61452, South Korea
[2] Fukuoka & Tokyo Univ Sci, Fuzzy Log Syst Inst, Tokyo, Japan
关键词
hybrid metaheuristic approach; genetic algorithm; particle swarm optimization; teaching and learning-based optimization; engineering optimization problem; GENETIC ALGORITHMS; NEIGHBORHOOD SEARCH; INTEGER; SWARM; SOLVE; VNS;
D O I
10.3934/mbe.2023025
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
Under addressing global competition, manufacturing companies strive to produce better and cheaper products more quickly. For a complex production system, the design problem is intrinsically a daunting optimization task often involving multiple disciplines, nonlinear mathematical model, and computation-intensive processes during manufacturing process. Here is a reason to develop a high performance algorithm for finding an optimal solution to the engineering design and/or optimization problems. In this paper, a hybrid metaheuristic approach is proposed for solving engineering optimization problems. A genetic algorithm (GA), particle swarm optimization (PSO), and teaching and learning-based optimization (TLBO), called the GA-PSO-TLBO approach, is used and demonstrated for the proposed hybrid metaheuristic approach. Since each approach has its strengths and weaknesses, the GA-PSO-TLBO approach provides an optimal strategy that maintains the strengths as well as mitigates the weaknesses, as needed. The performance of the GA-PSO-TLBO approach is compared with those of conventional approaches such as single metaheuristic approaches (GA, PSO and TLBO) and hybrid metaheuristic approaches (GA-PSO and GA-TLBO) using various types of engineering optimization problems. An additional analysis for reinforcing the performance of the GA-PSO-TLBO approach was also carried out. Experimental results proved that the GA-PSO-TLBO approach outperforms conventional competing approaches and demonstrates high flexibility and efficiency.
引用
收藏
页码:552 / 571
页数:20
相关论文
共 39 条
[1]   NONLINEAR MIXED-DISCRETE STRUCTURAL OPTIMIZATION [J].
AMIR, HM ;
HASEGAWA, T .
JOURNAL OF STRUCTURAL ENGINEERING-ASCE, 1989, 115 (03) :626-646
[2]  
[Anonymous], 1994, Genetic Algorithms + Data Structures = Evolution Programs
[3]   Hybridizations of genetic algorithms and neighborhood search metaheuristics for fuzzy bus terminal location problems [J].
Babaie-Kafaki, Saman ;
Ghanbari, Reza ;
Mahdavi-Amiri, Nezam .
APPLIED SOFT COMPUTING, 2016, 46 :220-229
[4]   Genetic algorithm with variable neighborhood search for the optimal allocation of goods in shop shelves [J].
Castelli, Mauro ;
Vanneschi, Leonardo .
OPERATIONS RESEARCH LETTERS, 2014, 42 (05) :355-360
[5]   An advanced GA-VNS combination for multicriteria route planning in public transit networks [J].
Dib, O. ;
Moalic, L. ;
Manier, M. -A. ;
Caminada, A. .
EXPERT SYSTEMS WITH APPLICATIONS, 2017, 72 :67-82
[6]   Combining VNS with Genetic Algorithm to solve the one-to-one routing issue in road networks [J].
Dib, Omar ;
Manier, Marie-Ange ;
Moalic, Laurent ;
Caminada, Alexandre .
COMPUTERS & OPERATIONS RESEARCH, 2017, 78 :420-430
[7]  
Fu J.F., 1991, ENG OPTIMIZ, V17, P263, DOI [10.1080/03052159108941075, DOI 10.1080/03052159108941075]
[8]  
Gandomi A. H., 2011, Computational Optimization, Methods and Algorithms, P267, DOI [10.1007/978-3-642-20859-1_12, DOI 10.1007/978-3-642-20859-1_12]
[9]   Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems [J].
Gandomi, Amir Hossein ;
Yang, Xin-She ;
Alavi, Amir Hossein .
ENGINEERING WITH COMPUTERS, 2013, 29 (01) :17-35
[10]  
Gen M., 1997, Genetic Algorithms and Engineering Design