Constraint-oriented refinement-efficacious memetic algorithms for efficient optimization of computationally-expensive problems
Successes of the Memetic Algorithms (MAs) have since alleviated the problems of local optimum trap of the deterministic optimization techniques as well as of slow, imprecise convergence of the stochastic optimization approaches. Through the hybridization of local search and global search by interlea...
Saved in:
Main Author: | Handoko, Stephanus Daniel |
---|---|
Other Authors: | Kwoh Chee Keong |
Format: | Theses and Dissertations |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/54901 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Building algorithm portfolios for memetic algorithms
by: MISIR, Mustafa, et al.
Published: (2014) -
Feasibility structure modeling : an effective chaperone for constrained memetic algorithms
by: Handoko, Stephanus Daniel, et al.
Published: (2021) -
Evolutionary optimization for computationally expensive problems
by: Lim, Dudy
Published: (2009) -
OSCAR: Online selection of algorithm portfolios with case study on memetic algorithms
by: MISIR, Mustafa, et al.
Published: (2015) -
Reinforcement learning for adaptive operator selection in memetic search applied to Quadratic Assignment Problem
by: HANDOKO, Stephanus Daniel, et al.
Published: (2014)