Multi-objective ant lion optimizer: a multi-objective optimization algorithm for solving engineering problems

被引:0
作者
Seyedali Mirjalili
Pradeep Jangir
Shahrzad Saremi
机构
[1] Griffith University,School of Information and Communication Technology
[2] Griffith College,undefined
[3] Lukhdhirji Engineering College,undefined
来源
Applied Intelligence | 2017年 / 46卷
关键词
Ant lion optimizer; Multi-objective optimization; Optimization; Evolutionary algorithm; Multi-criterion optimization; Heuristic; Algorithm; Meta-heuristic; Engineering optimization;
D O I
暂无
中图分类号
学科分类号
摘要
This paper proposes a multi-objective version of the recently proposed Ant Lion Optimizer (ALO) called Multi-Objective Ant Lion Optimizer (MOALO). A repository is first employed to store non-dominated Pareto optimal solutions obtained so far. Solutions are then chosen from this repository using a roulette wheel mechanism based on the coverage of solutions as antlions to guide ants towards promising regions of multi-objective search spaces. To prove the effectiveness of the algorithm proposed, a set of standard unconstrained and constrained test functions is employed. Also, the algorithm is applied to a variety of multi-objective engineering design problems: cantilever beam design, brushless dc wheel motor design, disk brake design, 4-bar truss design, safety isolating transformer design, speed reduced design, and welded beam deign. The results are verified by comparing MOALO against NSGA-II and MOPSO. The results of the proposed algorithm on the test functions show that this algorithm benefits from high convergence and coverage. The results of the algorithm on the engineering design problems demonstrate its applicability is solving challenging real-world problems as well.
引用
收藏
页码:79 / 95
页数:16
相关论文
共 72 条
[1]  
Kelley CT(1999)Detection and remediation of stagnation in the Nelder–Mead algorithm using a sufficient decrease condition SIAM J Optim 10 43-55
[2]  
Vogl TP(1988)Accelerating the convergence of the back-propagation method Biol Cybern 59 257-263
[3]  
Mangis J(2004)Survey of multi-objective optimization methods for engineering Struct Multidiscip Optim 26 369-395
[4]  
Rigler A(2002)Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art Comput Methods Appl Mech Eng 191 1245-1287
[5]  
Zink W(2007)Robust optimization–a comprehensive survey Comput Methods Appl Mech Eng 196 3190-3218
[6]  
Alkon D(1993)Analyzing deception in trap functions Found Genet Algoritm 2 93-108
[7]  
Marler RT(1998)Normal-boundary intersection: a new method for generating the Pareto surface in nonlinear multicriteria optimization problems SIAM J Optim 8 631-657
[8]  
Arora JS(2005)Adaptive weighted-sum method for bi-objective optimization: Pareto front generation Struct Multidiscip Optim 29 149-158
[9]  
Coello CAC(2002)Generating well-distributed sets of Pareto points for engineering design using physical programming Optim Eng 3 431-450
[10]  
Beyer H-G(2002)A fast and elitist multiobjective genetic algorithm: NSGA-II IEEE Trans Evol Comput 6 182-197