A directed search strategy for evolutionary dynamic multiobjective optimization

Verfasser / Beitragende:
[Yan Wu, Yaochu Jin, Xiaoxiong Liu]
Ort, Verlag, Jahr:
2015
Enthalten in:
Soft Computing, 19/11(2015-11-01), 3221-3235
Format:
Artikel (online)
ID: 605470731
LEADER caa a22 4500
001 605470731
003 CHVBK
005 20210128100329.0
007 cr unu---uuuuu
008 210128e20151101xx s 000 0 eng
024 7 0 |a 10.1007/s00500-014-1477-4  |2 doi 
035 |a (NATIONALLICENCE)springer-10.1007/s00500-014-1477-4 
245 0 2 |a A directed search strategy for evolutionary dynamic multiobjective optimization  |h [Elektronische Daten]  |c [Yan Wu, Yaochu Jin, Xiaoxiong Liu] 
520 3 |a Many real-world multiobjective optimization problems are dynamic, requiring an optimization algorithm that is able to continuously track the moving Pareto front over time. In this paper, we propose a directed search strategy (DSS) consisting of two mechanisms for improving the performance of multiobjective evolutionary algorithms in changing environments. The first mechanism reinitializes the population based on the predicted moving direction as well as the directions that are orthogonal to the moving direction of the Pareto set, when a change is detected. The second mechanism aims to accelerate the convergence by generating solutions in predicted regions of the Pareto set according to the moving direction of the non-dominated solutions between two consecutive generations. The two mechanisms, when combined together, are able to achieve a good balance between exploration and exploitation for evolutionary algorithms to solve dynamic multiobjective optimization problems. We compare DSS with two existing prediction strategies on a variety of test instances having different changing dynamics. Empirical results show that DSS is powerful for evolutionary algorithms to deal with dynamic multiobjective optimization problems. 
540 |a Springer-Verlag Berlin Heidelberg, 2014 
690 7 |a Dynamic multiobjective optimization  |2 nationallicence 
690 7 |a Evolutionary algorithm  |2 nationallicence 
690 7 |a Prediction  |2 nationallicence 
690 7 |a Local search  |2 nationallicence 
700 1 |a Wu  |D Yan  |u School of Mathematics and Statistics, Xidian University, 710071, Xian, China  |4 aut 
700 1 |a Jin  |D Yaochu  |u Department of Computing, University of Surrey, GU2 7XH, Guildford, UK  |4 aut 
700 1 |a Liu  |D Xiaoxiong  |u School of Automation, Northwestern Polytechnical University, 710072, Xian, China  |4 aut 
773 0 |t Soft Computing  |d Springer Berlin Heidelberg  |g 19/11(2015-11-01), 3221-3235  |x 1432-7643  |q 19:11<3221  |1 2015  |2 19  |o 500 
856 4 0 |u https://doi.org/10.1007/s00500-014-1477-4  |q text/html  |z Onlinezugriff via DOI 
898 |a BK010053  |b XK010053  |c XK010000 
900 7 |a Metadata rights reserved  |b Springer special CC-BY-NC licence  |2 nationallicence 
908 |D 1  |a research-article  |2 jats 
949 |B NATIONALLICENCE  |F NATIONALLICENCE  |b NL-springer 
950 |B NATIONALLICENCE  |P 856  |E 40  |u https://doi.org/10.1007/s00500-014-1477-4  |q text/html  |z Onlinezugriff via DOI 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Wu  |D Yan  |u School of Mathematics and Statistics, Xidian University, 710071, Xian, China  |4 aut 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Jin  |D Yaochu  |u Department of Computing, University of Surrey, GU2 7XH, Guildford, UK  |4 aut 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Liu  |D Xiaoxiong  |u School of Automation, Northwestern Polytechnical University, 710072, Xian, China  |4 aut 
950 |B NATIONALLICENCE  |P 773  |E 0-  |t Soft Computing  |d Springer Berlin Heidelberg  |g 19/11(2015-11-01), 3221-3235  |x 1432-7643  |q 19:11<3221  |1 2015  |2 19  |o 500