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...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
2013
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/54901 |