Proactive Evolutionary Algorithms for Dynamic Optimization Problems

Patryk Filipiak

2014

Abstract

This paper proposes the three anticipation strategies applicable to Evolutionary Algorithms in order to improve their performance in solving Dynamic Optimization Problems. The proposed approaches realize a proactive model in dealing with the changing landscapes. It collects the past observations of the changing environment and utilizes them to anticipate the future landscape. This way, the Evolutionary Algorithm can deal in advance with the changes to come by directing a part of the population towards the most probable future promising regions.

References

  1. Bosman, P. A. N. (2005). Learning, anticipation and timedeception in evolutionary online dynamic optimization. In Proceedings of the 2005 workshops on Genetic and evolutionary computation, pages 39-47.
  2. Box, G. E., Jenkins, G. M., and Reinsel, G. C. (2011). Time series analysis: forecasting and control, volume 734. John Wiley & Sons.
  3. Branke, J. (2001). Evolutionary optimization in dynamic environments. Kluwer Academic Publishers.
  4. Brzychczy, E., Lipinski, P., Zimroz, R., and Filipiak, P. (2014). Artificial immune systems for data classification in planetary gearboxes condition monitoring. In Advances in Condition Monitoring of Machinery in Non-Stationary Operations, LNME, pages 235-247. Springer.
  5. Castellani, M. and Fahmy, A. A. (2008). Learning the inverse kinematics of a robot manipulator using the bees algorithm. In Proceedings of the 6th IEEE International Conference on Industrial Informatics (INDIN 2008), pages 493-498.
  6. Cobb, H. G. (1990). An investigation into the use of hypermutation as an adaptive operator in genetic algorithms having continuous, time-dependent nonstationary environments. Technical Report AIC-90-001.
  7. Deb, K., Pratap, A., Agarwal, A., and Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6:182-197.
  8. Eggermont, J., Lenaerts, T., Poyhonen, S., and Termier, A. (2001). Raising the dead: Extending evolutionary algorithms with a case-based memory. Genetic Programming, pages 280-290.
  9. Farina, M., Deb, K., and Amato, P. (2004). Multiobjective optimization problems: Test cases, approximations and applications. IEEE Transactions on Evolutionary Computation, 8(5):425-442.
  10. Filipiak, P. and Lipinski, P. (2012). Parallel CHC algorithm for solving dynamic traveling salesman problem using many-core GPU. In Proceedings of Artificial Intelligence: Methodology, Systems and Applications (AIMSA 2012), volume 7557 of LNAI, pages 305-314. Springer.
  11. Filipiak, P. and Lipinski, P. (2014a). Infeasibility driven evolutionary algorithm with feed-forward prediction strategy for dynamic constrained optimization problems. In EvoApplications 2014, LNCS. Springer.
  12. Filipiak, P. and Lipinski, P. (2014b). Univariate marginal distribution algorithm with markov chain predictor in continuous dynamic environments. In Proceedings of Intelligent Data Engineering and Automated Learning (IDEAL 2014), LNCS. Springer.
  13. Filipiak, P., Michalak, K., and Lipinski, P. (2011). Infeasibility driven evolutionary algorithm with ARIMAbased prediction mechanism. In Proceedings of Intelligent Data Engineering and Automated Learning (IDEAL 2011), volume 6936 of LNCS, pages 345- 352. Springer.
  14. Filipiak, P., Michalak, K., and Lipinski, P. (2012a). Evolutionary approach to multiobjective optimization of portfolios that reflect the behaviour of investment funds. In Proceedings of Artificial Intelligence: Methodology, Systems and Applications (AIMSA 2012), volume 7557 of LNAI, pages 202-211. Springer.
  15. Filipiak, P., Michalak, K., and Lipinski, P. (2012b). A predictive evolutionary algorithm for dynamic constrained inverse kinematics problems. In Proceedings of Hybrid Artificial Intelligence Systems (HAIS 2012), volume 7208 of LNCS, pages 610-621. Springer.
  16. Grefenstette, J. (1992). Genetic algorithms for changing environments. In Parallel Problem Solving from Nature 2, pages 137-144.
  17. Li, C., Yang, S., Nguyen, T. T., Yu, E. L., Yao, X., Jin, Y., Beyer, H.-G., and Suganthan, P. N. (2008). Benchmark generator for cec 2009 competition on dynamic optimization. Technical report, University of Leicester, University of Birmingham, Nanyang Technological University.
  18. Liu, X., Wu, Y., and Ye, J. (2008). An improved estimation of distribution algorithm in dynamic environments. In Proceedings of the IEEE Fourth International Conference on Natural Computation (ICNC 2008), volume 6, pages 269-272.
  19. Michalak, K., Filipiak, P., and Lipinski, P. (2013). Usage patterns of trading rules in stock market trading strategies optimized with evolutionary methods. In EvoApplications 2013, volume 7835 of LNCS, pages 234- 243. Springer.
  20. Michalak, K., Filipiak, P., and Lipinski, P. (2014). Multiobjective dynamic constrained evolutionary algorithm for control of a multi-segment articulated manipulator. In Proceedings of Intelligent Data Engineering and Automated Learning (IDEAL 2014), LNCS. Springer.
  21. Nguyen, T. T. and Yao, X. (2009a). Benchmarking and solving dynamic constrained problems. In Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2009), pages 690-697.
  22. Nguyen, T. T. and Yao, X. (2009b). Dynamic timelinkage problems revisited. Applications of Evolutionary Computing, pages 735-744.
  23. Richter, H. and Yang, S. (2008). Memory based on abstraction for dynamic fitness functions. In EvoWorkshops 2008, volume 4974 of LNCS, pages 596-605. Springer.
  24. Rossi, C., Abderrahim, M., and Díaz, J. C. (2008). Tracking moving optima using Kalman-based predictions. Evolutionary Computation, 16(1):1-30.
  25. Simo˜es, A. and Costa, E. (2011). CHC-based algorithms for the dynamic traveling salesman problem. In Applications of Evolutionary Computation, volume 6624, pages 354-363.
  26. Simo˜es, A. and Costa, E. (2013). Prediction in evolutionary algorithms for dynamic environments. Soft Computing, pages 1-27.
  27. Singh, H. K., Isaacs, A., Nguyen, T. T., Ray, T., and Yao, X. (2009a). Performance of infeasibility driven evolutionary algorithm (IDEA) on constrained dynamic single objective optimization problems. In Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2009), pages 3127-3134.
  28. Singh, H. K., Isaacs, A., Ray, T., and Smith, W. (2009b). Infeasibility driven evolutionary algorithm for constrained optimization. Constraint Handling in Evolutionary Optimization, Studies in Computational Intelligence, pages 145-165.
  29. van Hemert, J., van Hoyweghen, C., Lukschandl, E., and Verbeeck, K. (2001). A “futurist” approach to dynamic environments. In GECCO EvoDOP Workshop, pages 35-38.
  30. Vavak, F., Jukes, K., and Fogarty, T. C. (1997). Adaptive combustion balancing in multiple burner bolier using a genetic algorithm with variable range of local search. In Proceedings of the International Conference on Genetic Algorithms (ICGA 1997), pages 719- 726.
  31. Yang, S. (2005). Memory-based immigrants for genetic algorithms in dynamic environments. In Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2005), pages 1115-1122.
  32. Yang, S. (2006). On the design of diploid genetic algorithms for problem optimization in dynamic environments. In Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2006), pages 1362-1369.
  33. Yang, S. and Yao, X. (2008). Population-based incremental learning with associative memory for dynamic environments. IEEE Transactions on Evolutionary Computation, 12(5):542-561.
  34. Zhou, A., Jin, Y., Zhang, Q., Sendhoff, B., and Tsang, E. (2007). Prediction-based population re-initialization for evolutionary dynamic multi-objective optimization. Evolutionary Multi-Criterion Optimization, pages 832-846.
Download


Paper Citation


in Harvard Style

Filipiak P. (2014). Proactive Evolutionary Algorithms for Dynamic Optimization Problems . In Doctoral Consortium - DCCI, (IJCCI 2014) ISBN Not Available, pages 3-13


in Bibtex Style

@conference{dcci14,
author={Patryk Filipiak},
title={Proactive Evolutionary Algorithms for Dynamic Optimization Problems},
booktitle={Doctoral Consortium - DCCI, (IJCCI 2014)},
year={2014},
pages={3-13},
publisher={SciTePress},
organization={INSTICC},
doi={},
isbn={Not Available},
}


in EndNote Style

TY - CONF
JO - Doctoral Consortium - DCCI, (IJCCI 2014)
TI - Proactive Evolutionary Algorithms for Dynamic Optimization Problems
SN - Not Available
AU - Filipiak P.
PY - 2014
SP - 3
EP - 13
DO -