Feasibility Structure Modeling: An Effective Chaperone for Constrained Memetic Algorithms

  title={Feasibility Structure Modeling: An Effective Chaperone for Constrained Memetic Algorithms},
  author={Stephanus Daniel Handoko and Chee Keong Kwoh and Yew-Soon Ong},
  journal={IEEE Transactions on Evolutionary Computation},
An important issue in designing memetic algorithms (MAs) is the choice of solutions in the population for local refinements, which becomes particularly crucial when solving computationally expensive problems. With single evaluation of the objective/constraint functions necessitating tremendous computational power and time, it is highly desirable to be able to focus search efforts on the regions where the global optimum is potentially located so as not to waste too many function evaluations. For… CONTINUE READING


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


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

Algorithms for Continuous Optimization: The State of the Art

  • E. Spedicato
  • Springer
  • 1994
Highly Influential
12 Excerpts

NLPQL: A FORTRAN Subroutine Solving Constrained Nonlinear Programming Problems,

  • K. Schittkowski
  • Annals of Operations Research,
  • 1986
Highly Influential
12 Excerpts

A Simplicial Algorithm for Convex Programming,

  • R. B. Wilson
  • Ph.D. Thesis, Harvard University,
  • 1963
Highly Influential
12 Excerpts


  • M. H. Lim, S. Gustafson
  • Krasnogor, and Y.S. Ong, ”Editorial to the First…
  • 2009

Similar Papers

Loading similar papers…