A hybrid method for solving multi-objective global optimization problems

被引:28
作者
Gil, C. [1 ]
Marquez, A.
Banos, R.
Montoya, M. G.
Gomez, J.
机构
[1] Univ Almeria, Dept Arquitectura Comp & Elect, Canada De San Urbano 04120, Almeria, Spain
[2] Univ Almeria, Dept Lenguajes & Computac, Canada De San Urbano 04120, Almeria, Spain
关键词
multi-objective optimization; global pareto-optimal front; evolutionary algorithms;
D O I
10.1007/s10898-006-9105-1
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Real optimization problems often involve not one, but multiple objectives, usually in conflict. In single-objective optimization there exists a global optimum, while in the multi-objective case no optimal solution is clearly defined but rather a set of optimums, which constitute the so called Pareto-optimal front. Thus, the goal of multi-objective strategies is to generate a set of non-dominated solutions as an approximation to this front. However, most problems of this kind cannot be solved exactly because they have very large and highly complex search spaces. The objective of this work is to compare the performance of a new hybrid method here proposed, with several well-known multi-objective evolutionary algorithms (MOEA). The main attraction of these methods is the integration of selection and diversity maintenance. Since it is very difficult to describe exactly what a good approximation is in terms of a number of criteria, the performance is quantified with adequate metrics that evaluate the proximity to the global Pareto-front. In addition, this work is also one of the few empirical studies that solves three-objective optimization problems using the concept of global Pareto-optimality.
引用
收藏
页码:265 / 281
页数:17
相关论文
共 21 条
[1]  
[Anonymous], 2001, SPEA2 IMPROVING STRE, DOI DOI 10.3929/ETHZ-A-004284029
[2]  
[Anonymous], 1995, Handbook of global optimization, Nonconvex Optimization and its Applications
[3]  
BANOS R, 2007, J MATH MODELLING ALG, V6, P213, DOI DOI 10.1007/S10852-006-9041-6
[4]   An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem [J].
Benson, HP .
JOURNAL OF GLOBAL OPTIMIZATION, 1998, 13 (01) :1-24
[5]  
Coello C. A. C., 2002, EVOLUTIONARY ALGORIT
[6]  
CORNE DW, 2000, SPRINGER LECT NOTES, V1917, P869
[7]  
Deb K., 2000, Parallel Problem Solving from Nature PPSN VI. 6th International Conference. Proceedings (Lecture Notes in Computer Science Vol.1917), P849
[8]  
Deb K, 2001, LECT NOTES COMPUT SC, V1993, P284
[9]  
Deb K, 2011, Multi-objective optimization using evolutionary algorithm
[10]  
EB K, 2005, EVOLUTIONARY COMPUTA, P105