Feasibility structure modeling : an effective chaperone for constrained memetic algorithms
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 compu...
Saved in:
Main Authors: | Handoko, Stephanus Daniel, Kwoh, Chee Keong, Ong, Yew-Soon |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Article |
Language: | English |
Published: |
2021
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/147975 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Genetic Algorithm and its advances in embracing memetics
by: Feng, Liang, et al.
Published: (2021) -
Multi-objective memetic algorithms|h[electronic resource
Published: (2017) -
Building algorithm portfolios for memetic algorithms
by: MISIR, Mustafa, et al.
Published: (2014) -
An evolutionary memetic algorithm for rule extraction
by: Ang, J.H., et al.
Published: (2014) -
Lamarckian memetic algorithms : local optimum and connectivity structure analysis
by: Le, Minh Nghia, et al.
Published: (2021)