A Runtime Analysis of Evolutionary Algorithms for Constrained Optimization Problems

@article{Zhou2007ARA,
  title={A Runtime Analysis of Evolutionary Algorithms for Constrained Optimization Problems},
  author={Yuren Zhou and Jun He},
  journal={IEEE Transactions on Evolutionary Computation},
  year={2007},
  volume={11},
  pages={608-619}
}
Although there are many evolutionary algorithms (EAs) for solving constrained optimization problems, there are few rigorous theoretical analyses. This paper presents a time complexity analysis of EAs for solving constrained optimization. It is shown when the penalty coefficient is chosen properly, direct comparison between pairs of solutions using penalty fitness function is equivalent to that using the criteria ldquosuperiority of feasible pointrdquo or ldquosuperiority of objective function… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 36 extracted citations

Evolutionary Computation in Combinatorial Optimization

Lecture Notes in Computer Science • 2015
View 5 Excerpts
Highly Influenced

Average Drift Analysis and Population Scalability

IEEE Transactions on Evolutionary Computation • 2017
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-10 of 30 references

How Mutation and Selection Solve Long-Path Problems in Polynomial Expected Time

Evolutionary Computation • 1996
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…