A BRIEF ANALYSIS OF EVOLUTIONARY ALGORITHMS FOR THE DYNAMIC MULTIOBJECTIVE SUBSET SUM PROBLEM

被引:0
作者
Comsa, Iulia [1 ]
Grosan, Crina [1 ]
Yang, Shengxiang [2 ]
机构
[1] Univ Babes Bolyai, Dept Comp Sci, Cluj Napoca, Romania
[2] Brunel Univ, Dept Informat Syst & Comp, Uxbridge UB8 3PH, Middx, England
来源
KEPT 2011: KNOWLEDGE ENGINEERING PRINCIPLES AND TECHNIQUES | 2011年
关键词
dynamic environment; multiobjective optimization; NP-completeness;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The paper investigate the behavior of evolutionary algorithms for solving multiobjective combinatorial problems in dynamic environments. Present work envisages the multiobjective subset sum problem which is known as an NP-hard problem [2]. Several test and analysis are performed in order to asses the advantages and to point out the disadvantages and drawbacks of these classes of algorithms.
引用
收藏
页码:177 / 184
页数:8
相关论文
共 8 条
[1]  
[Anonymous], 1990, COMPUT INTRACTABILIT
[2]  
Branke J., 2002, EVOLUTIONARY OPTIMIZ
[3]  
KHURI S, 1994, P 22 ANN ACM COMP SC, P66
[4]  
Liekens A.M.L., 2005, THESIS
[5]  
Morrison RonaldW., 2004, NAT COMP SER
[6]   Dynamic combinatorial optimisation problems: an analysis of the subset sum problem [J].
Rohlfshagen, Philipp ;
Yao, Xin .
SOFT COMPUTING, 2011, 15 (09) :1723-1734
[7]  
Weicker K., 2003, Evolutionary algorithms and dynamic optimization problems
[8]  
Wilke C., 1999, THESIS