Asymptotic convergence of metaheuristics for multiobjective optimization problems

被引：15
作者：
Villalobos-Arias, Mario
Coello Coello, Carlos A.
Hernandez-Lerma, Onesimo
机构：
[1] IPN, CINVESTAV, Dept Math, Mexico City 07000, DF, Mexico
[2] Univ Costa Rica, Escuela Matemat, San Jose, Costa Rica
[3] IPN, CINVESTAV, Evolutionary Computat Grp, Dept Ingn Elect,Secc Computac, Mexico City 07300, DF, Mexico
来源：
SOFT COMPUTING | 2006年 / 10卷 / 11期
关键词：
metaheuristics; multiobjective optimization; multiobjective metaheuristics;
D O I：
10.1007/s00500-005-0027-5
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
This paper analyzes the convergence of metaheuristics used for multiobjective optimization problems in which the transition probabilities use a uniform mutation rule. We prove that these algorithms converge only if elitism is used.
引用
收藏
页码：1001 / 1005
页数：5
相关论文
共 13 条
[1]   Metaheuristics in combinatorial optimization: Overview and conceptual comparison [J].
Blum, C ;
Roli, A .
ACM COMPUTING SURVEYS, 2003, 35 (03) :268-308
[2]  
Coello C. A. C., 2002, EVOLUTIONARY ALGORIT
[3]  
Dasgupta D., 1999, Artificial Immune Systems and their Applications
[4]  
DECASTRO LN, 2002, INTRO ARTIFICIAL IMM
[5]  
Doob J.L., 1953, Stochastic processes
[6]  
Fogel L. J., 1966, ARTIFICIAL INTELLIGE, DOI DOI 10.1109/9780470544600.CH7
[7]  
Fogel LJ, 1999, ARTIFICIAL INTELLIGE
[8]  
Goldberg D.E., 1989, OPTIMIZATION MACHINE
[9]  
Jones A, 2000, RUSS EDUC SOC, V42, P3, DOI 10.1046/j.1365-2796.2000.00626.x
[10]   CONVERGENCE ANALYSIS OF CANONICAL GENETIC ALGORITHMS [J].
RUDOLPH, G .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 1994, 5 (01) :96-101
12