Skip to main content

Infeasibility Driven Evolutionary Algorithm with Feed-Forward Prediction Strategy for Dynamic Constrained Optimization Problems

  • Conference paper
  • First Online:
Applications of Evolutionary Computation (EvoApplications 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8602))

Included in the following conference series:

Abstract

This paper proposes a modification of Infeasibility Driven Evolutionary Algorithm that applies the anticipation mechanism following Feed-forward Prediction Strategy. The presented approach allows reacting on environmental changes more rapidly by directing some individuals into the areas of most probable occurrences of future optima. Also a novel population segmentation on exploring, exploiting and anticipating fractions is introduced to assure a better diversification of individuals and thus improve the ability to track moving optima. The experiments performed on the popular benchmarks confirmed the significant improvement in Dynamic Constrained Optimization Problems when using the proposed approach.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Box, G.E.P., Jenkins, G.M., Reinsel, G.C.: Time series analysis: forecasting and control. Wiley.com (2013)

    Google Scholar 

  2. Branke, J.: Evolutionary optimization in dynamic environments. Kluwer Academic Publishers (2001)

    Google Scholar 

  3. Deb, K., Pratap, A., Agarwal, A., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. on Evol. Comput. 6, 182–197 (2002)

    Article  Google Scholar 

  4. Derrac, J., García, S., Molina, D., Herrera, F.: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm and Evolutionary Comput. 1, 3–18 (2011)

    Article  Google Scholar 

  5. Farina, M., Deb, K., Amato, P.: Dynamic Multiobjective Optimization Problems: Test Cases, Approximations and Applications. IEEE Trans. on Evolutionary Comput. 8(5), 425–442 (2004)

    Article  Google Scholar 

  6. Filipiak, P., Michalak, K., Lipinski, P.: Infeasibility Driven Evolutionary Algorithm with ARIMA-Based Prediction Mechanism. In: Yin, H., Wang, W., Rayward-Smith, V. (eds.) IDEAL 2011. LNCS, vol. 6936, pp. 345–352. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  7. Hatzakis, I., Wallace, D.: Dynamic multi-objective optimization with evolutionary algorithms: A forward-looking approach. In: Proc. of the 8th Annual Conf. on Genetic and Evolutionary Computation (GECCO 2006), pp. 1201–1208 (2006)

    Google Scholar 

  8. Liang, J.J., Runarsson, T.P., Mezura-Montes, E., Clerc, M., Suganthan, P., Coello Coello, C.A., Deb, K.: Problem definitions and evaluation criteria for the CEC 2006 special session on constrained real-parameter optimization. Nangyang Technological University, Singapore, Tech, Rep. (2006)

    Google Scholar 

  9. Nguyen, T., Yao, X.: Benchmarking and solving dynamic constrained problems. In: Proc. of the IEEE Congress on Evolutionary Comput., pp. 690–697 (CEC 2009)

    Google Scholar 

  10. Nguyen, T., Yao, X.: Continuous dynamic constrained optimisation - the challenges. IEEE Trans. on Evolutionary Comput. (2012) (accepted paper)

    Google Scholar 

  11. Nguyen, T., Yao, X.: Solving dynamic constrained optimisation problems using repair methods. IEEE Trans. on Evolutionary Comput. (2013) (submitted paper)

    Google Scholar 

  12. Simões, A., Costa, E.: Evolutionary Algorithms for Dynamic Environments: Prediction Using Linear Regression and Markov Chains. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. LNCS, vol. 5199, pp. 306–315. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  13. Singh, H.K., Isaacs, A., Nguyen, T.T., Ray, T., Yao, X.: Performance of infeasibility driven evolutionary algorithm (IDEA) on constrained dynamic single objective optimization problems. In: Proc. of the IEEE Congress on Evolutionary Comput. (CEC 2009), pp. 3127–3134 (2009)

    Google Scholar 

  14. Singh, H.K., Isaacs, A., Ray, T., Smith, W.: Infeasibility driven evolutionary algorithm for constrained optimization. In: Constraint Handling in Evolutionary Optimization. Studies in Comput. Intelligence, pp. 145–165 (2009)

    Google Scholar 

  15. Yang, S., Yao, X. (eds.): Evolutionary Computation for Dynamic Optimization Problems. Studies in Comput. Intelligence, vol. 490. Springer (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Patryk Filipiak .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Filipiak, P., Lipinski, P. (2014). Infeasibility Driven Evolutionary Algorithm with Feed-Forward Prediction Strategy for Dynamic Constrained Optimization Problems. In: Esparcia-Alcázar, A., Mora, A. (eds) Applications of Evolutionary Computation. EvoApplications 2014. Lecture Notes in Computer Science(), vol 8602. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45523-4_66

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-45523-4_66

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-45522-7

  • Online ISBN: 978-3-662-45523-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics