A novel Pareto-based multi-objective vibration damping optimization algorithm to solve multi-objective optimization problems

被引:0
作者
Hajipour, V. [1 ]
Mehdizadeh, E. [2 ]
Tavakkoli-Moghaddam, R. [3 ]
机构
[1] Islamic Azad Univ, Young Researchers & Elite Club, Qazvin Branch, Qazvin, Iran
[2] Islamic Azad Univ, Dept Ind & Mech Engn, Qazvin Branch, Qazvin, Iran
[3] Univ Tehran, Coll Engn, Sch Ind Engn, Tehran, Iran
关键词
Multi-objective optimization; Vibration damping optimization; Pareto optimal solution; NSGA-II; MOSA; LOCATION; DOMINANCE; INVENTORY; DEMAND;
D O I
暂无
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper presents a Vibration Damping Optimization (VDO) algorithm to solve multi-objective optimization problems for the first time. To do this, fast non-dominated sorting and crowding distance concepts were used in order to find and manage the Pareto-optimal solution. The proposed VDO is validated using several examples taken from the literature. The results were compared with Multi-Objective Simulated Annealing (MOSA) and Non-dominated Sorting Genetic Algorithms (NSGA-II) presented as state-of-the-art in evolutionary multi-objective optimization algorithms. The results indicate that Multi-Objective VDO (MOVDO) gives better performance with a significant difference in terms of computational time, while NSGA-II is better in finding Pareto solutions. In other standard metrics, MOVDO is able to generate true and well-distributed Pareto optimal solutions and compete with NSGA-II and MOSA. (C) 2014 Sharif University of Technology. All rights reserved.
引用
收藏
页码:2368 / 2378
页数:11
相关论文
共 36 条
[1]  
Amodeo L, 2008, STUD COMPUT INTELL, V144, P211
[2]  
[Anonymous], MATLAB VERS 7 10 0 4
[3]  
[Anonymous], 1966, Artificial_Intelligence_Through_Simulated Evolution
[4]   Incorporating ε-dominance in AMOSA: Application to multiobjective 0/1 knapsack problem and clustering gene expression data [J].
Bandyopadhyay, Sanghamitra ;
Maulik, Ujjwal ;
Chakraborty, Rudrasis .
APPLIED SOFT COMPUTING, 2013, 13 (05) :2405-2411
[5]   Solving conflicting bi-objective facility location problem by NSGA II evolutionary algorithm [J].
Bhattacharya, Ranjan ;
Bandyopadhyay, Susmita .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2010, 51 (1-4) :397-414
[6]  
Coello C, 2002, Evolutionary Algorithms for Solving Multi -objective Problems, DOI [10.1007/978-1-4757-5184-0, DOI 10.1007/978-1-4757-5184-0]
[7]  
Coello C.A.C., 2007, Evolutionary Algorithms for Solving Multi-Objective Problems, V5, DOI DOI 10.1007/978-0-387-36797-2
[8]  
Deb, 1994, EVOLUTIONARY COMPUTA, V2, P221, DOI DOI 10.1162/EVCO.1994.2.3.221
[9]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[10]  
Deb K., 2001, Multi-objective Optimization Using Evolutionary Algorithms