Differential evolution with multi-constraint consensus methods for constrained optimization

  • Authors:

  • Noha M. Hamza;Ruhul A. Sarker;Daryl L. Essam

  • Affiliations:

  • School of Engineering and Information Technology, University of New South Wales, Australian Defense Force Academy, Canberra, Australia 2600;School of Engineering and Information Technology, University of New South Wales, Australian Defense Force Academy, Canberra, Australia 2600;School of Engineering and Information Technology, University of New South Wales, Australian Defense Force Academy, Canberra, Australia 2600

  • Venue:
  • Journal of Global Optimization
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Constrained optimization is an important research topic that assists in quality planning and decision making. To solve such problems, one of the important aspects is to improve upon any constraint violation, and thus bring infeasible individuals to the feasible region. To achieve this goal, different constraint consensus methods have been introduced, but no single method performs well for all types of problems. Hence, in this research, for solving constrained optimization problems, we introduce different variants of the Differential Evolution algorithm, with multiple constraint consensus methods. The proposed algorithms are tested and analyzed by solving a set of well-known bench mark problems. For further improvements, a local search is applied to the best variant. We have compared our algorithms among themselves, as well as with other state of the art algorithms. Those comparisons show similar, if not better performance, while also using significantly lower computational time.