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:
主要作者: | |
---|---|
其他作者: | |
格式: | Theses and Dissertations |
語言: | English |
出版: |
2013
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/54901 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |
成為第一個發表評論!