Abstract
Evolutionary programming (EP) has been applied with success to many numerical and combinatorial optimization problems in recent years. However, most analytical and experimental results on EP have been obtained using low-dimensional problems. It is interesting to know whether the empirical results obtained from the low-dimensional problems still hold for high-dimensional cases. It was discovered that neither classical EP (CEP) nor fast EP (FEP) performed satisfactorily for some large-scale problems. This paper shows empirically that FEP with cooperative coevolution (FEPCC) can speed up convergence rates on the large-scale problems whose dimension ranges from 100 to 1000. Cooperative coevolution adopts the divide-and-conquer strategy. It divides the system into many modules, and evolves each module separately and cooperatively. The results of FEPCC on the problems investigated here are something of a surprise. The time used by FEPCC to find a near optimal solution appears to scale linearly; that is, the ti me used seems to go up linearly as the dimensionality of the problems studied increases.
Original language | English |
---|---|
Title of host publication | Proceedings of the IEEE Conference on Evolutionary Computation, ICEC |
Pages | 1101-1108 |
Number of pages | 8 |
Volume | 2 |
Publication status | Published - 2001 |
Externally published | Yes |