Performance of infeasibility driven evolutionary algorithm (IDEA) on constrained dynamic single objective optimization problems

  • Authors:

  • Hemant Kumar Singh;Amitay Isaacs;Trung Thanh Nguyen;Tapabrata Ray;Xin Yao

  • Affiliations:

  • School of Aerospace, Civil and Mechanical Engineering, University of New South Wales, Australian Defence Force Academy, Canberra, ACT, Australia;School of Aerospace, Civil and Mechanical Engineering, University of New South Wales, Australian Defence Force Academy, Canberra, ACT, Australia;The Centre of Excellence for Research in Computational Intelligence and Applications, School of Computer Science, University of Birmingham, United Kingdom;School of Aerospace, Civil and Mechanical Engineering, University of New South Wales, Australian Defence Force Academy, Canberra, ACT, Australia;The Centre of Excellence for Research in Computational Intelligence and Applications, School of Computer Science, University of Birmingham, United Kingdom

  • Venue:
  • CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

A number of population based optimization algorithms have been proposed in recent years to solve unconstrained and constrained single and multi-objective optimization problems. Most of such algorithms inherently prefer a feasible solution over an infeasible one during the course of search, which translates to approaching the constraint boundary from the feasible side of the search space. Previous studies [1], [2] have already demonstrated the benefits of explicitly maintaining a fraction of infeasible solutions in Infeasiblity Driven Evolutionary Algorithm (IDEA) for single and multi-objective constrained optimization problems. In this paper, the benefits of IDEA as a sub-evolve mechanism are highlighted for dynamic, constrained single objective optimization problems. IDEA is particularly attractive for such problems as it offers a faster rate of convergence over a conventional EA, which is of significant interest in dynamic optimization problems. The algorithm is tested on two new dynamic constrained test problems. For both the problems, the performance of IDEA is found to be significantly better than conventional EA.