What are dynamic optimization problems?

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Authors

  • Haobo Fu
  • Peter R. Lewis
  • Bernhard Sendhoff
  • Ke Tang
  • Xin Yao

Colleges, School and Institutes

External organisations

  • Aston University
  • Honda Research Institute Europe, Offenbach/Main
  • University of Science and Technology of China

Abstract

Dynamic Optimization Problems (DOPs) have been widely studied using Evolutionary Algorithms (EAs). Yet, a clear and rigorous definition of DOPs is lacking in the Evolutionary Dynamic Optimization (EDO) community. In this paper, we propose a unified definition of DOPs based on the idea of multiple-decision-making discussed in the Reinforcement Learning (RL) community. We draw a connection between EDO and RL by arguing that both of them are studying DOPs according to our definition of DOPs. We point out that existing EDO or RL research has been mainly focused on some types of DOPs. A conceptualized benchmark problem, which is aimed at the systematic study of various DOPs, is then developed. Some interesting experimental studies on the benchmark reveal that EDO and RL methods are specialized in certain types of DOPs and more importantly new algorithms for DOPs can be developed by combining the strength of both EDO and RL methods.

Details

Original languageEnglish
Title of host publicationProceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014
Publication statusPublished - 16 Sep 2014
Event2014 IEEE Congress on Evolutionary Computation, CEC 2014 - Beijing, China
Duration: 6 Jul 201411 Jul 2014

Conference

Conference2014 IEEE Congress on Evolutionary Computation, CEC 2014
CountryChina
CityBeijing
Period6/07/1411/07/14