Abstract
A new algorithm helps to accelerate convergence as well as to enhance diversity of the evolutionary programming (EP) search technique is proposed here based on an individual structure concept. The major components of the algorithm behind its good performance includes scaling, selection strategy, the use of age and the search direction (or momentum) vector, and the multiple offspring per parent. Not only the multiple offspring approach and the search direction vector concept are novel but the combination of these features used for EP are also new. Through a benchmark test, its search performance has been found to be superior to the conventional EP and one of its acceleration methods.
| Original language | English |
|---|---|
| Pages | 805-809 |
| Number of pages | 5 |
| State | Published - 1998 |
| Event | Proceedings of the 1998 IEEE International Conference on Evolutionary Computation, ICEC'98 - Anchorage, AK, USA Duration: 4 May 1998 → 9 May 1998 |
Conference
| Conference | Proceedings of the 1998 IEEE International Conference on Evolutionary Computation, ICEC'98 |
|---|---|
| City | Anchorage, AK, USA |
| Period | 4/05/98 → 9/05/98 |