Analysis of fitness landscape modifications in evolutionary dynamic optimization

被引:16
作者
Tinos, Renato [1 ]
Yang, Shengxiang [2 ]
机构
[1] Univ Sao Paulo, FFCLRP, Dept Comp & Math, BR-14040901 Ribeirao Preto, SP, Brazil
[2] De Montfort Univ, Sch Comp Sci & Informat, CCI, Leicester LE1 9BH, Leics, England
基金
英国工程与自然科学研究理事会; 巴西圣保罗研究基金会;
关键词
Evolutionary dynamic optimization; Benchmark problem generator; Theory of evolutionary algorithm; ALGORITHMS;
D O I
10.1016/j.ins.2014.05.053
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this work, discrete dynamic optimization problems (DOPs) are theoretically analysed according to the modifications produced in the fitness landscape during the optimization process, Using the proposed analysis framework, the following DOPs are analysed: problems generated by the XOR DOP generator, three versions of the dynamic 0-1 knapsack problem, one problem involving evolutionary robots in dynamic environments, and the random dynamics NK-model. The XOR DOP generator creates benchmark DOPs from any binary static optimization problem, which allows to explore the properties of the static problem in a dynamic environment. Three types of transformations occurring in the fitness landscapes are observed in the DOPs analysed here. They are caused by: (i) permutation of solutions in the search space; (ii) duplication of solutions; and (iii) adding deviations to the fitness of a subset of solutions. The XOR DOP generator creates a special type of permutation that is not found in the other investigated DOps. In this way, a new benchmark problem generator is proposed here based on the analysis performed, allowing to produce DOPs with six types of fitness landscape transformations, including those similar to the problems investigated in this paper. When compared to the XOR DOP generator, new algorithms can be tested and compared in a wider range of dynamic environments using the new generator. It is important to observe that some of the fitness transformations analysed here, like those caused by the duplication of solutions, are not currently explored in the evolutionary dynamic optimization area. (C) 2014 The Authors. Published by Elsevier Inc.
引用
收藏
页码:214 / 236
页数:23
相关论文
共 33 条
[1]  
[Anonymous], 1990, Knapsack Problems: Algorithms and ComputerImplementations
[2]  
[Anonymous], ADAPTIVE BEHAV
[3]  
Arnold D. V., 2002, Parallel Problem Solving from Nature - PPSN VII. 7th International Conference. Proceedings (Lecture Notes in Computer Science Vol.2439), P3
[4]  
Branke J., 2001, EVOLUTIONARY OPTIMIZ
[5]  
COBB HG, 1993, PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON GENETIC ALGORITHMS, P523
[6]   Optimization in dynamic environments: a survey on problems, methods and measures [J].
Cruz, Carlos ;
Gonzalez, Juan R. ;
Pelta, David A. .
SOFT COMPUTING, 2011, 15 (07) :1427-1448
[7]  
Droste S, 2002, IEEE C EVOL COMPUTAT, P55, DOI 10.1109/CEC.2002.1006209
[8]   On the performance of evolutionary algorithms with life-time adaptation in dynamic fitness landscapes [J].
Eriksson, R ;
Olsson, B .
CEC2004: PROCEEDINGS OF THE 2004 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2004, :1293-1300
[9]   Evolutionary optimization in uncertain environments - A survey [J].
Jin, Y ;
Branke, H .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2005, 9 (03) :303-317
[10]  
Jones T., 1995, P 6 INT C GENETIC AL, P184