Ensemble strategies with evolutionary programming and differential evolution for solving single objective optimization problems
Evolutionary Algorithms (EAs) are population based algorithms that can tackle complex optimization problems with minimal information about the characteristics of the problem. The performance of Evolutionary Programming (EP), a veteran of the evolutionary computation community depends mostly on the m...
Saved in:
Main Author: | Mallipeddi Rammohan. |
---|---|
Other Authors: | Ponnuthurai Nagaratnam Suganthan |
Format: | Theses and Dissertations |
Language: | English |
Published: |
2010
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/42370 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Ensemble of mutation strategies in evolutionary programming
by: Mallipeddi Sireehsa.
Published: (2009) -
Ensemble differential evolution with dynamic subpopulations and adaptive clearing for solving dynamic optimization problems
by: Suganthan, P. N., et al.
Published: (2013) -
Solving combinatorial optimization problems by soft computing
by: Li, Sa.
Published: (2008) -
Cardinality constrained portfolio optimization using multi-objective evolutionary algorithms
by: Ashok, Vivek Kumar.
Published: (2013) -
Chaotic neural networks for solving combinatorial optimization problems
by: Tian, Fuyu.
Published: (2008)