Please use this identifier to cite or link to this item:
|Title:||A distributed cooperative coevolutionary algorithm for multiobjective optimization|
|Authors:||Tan, K.C. |
|Citation:||Tan, K.C., Yang, Y.J., Goh, C.K. (2006-10). A distributed cooperative coevolutionary algorithm for multiobjective optimization. IEEE Transactions on Evolutionary Computation 10 (5) : 527-549. ScholarBank@NUS Repository. https://doi.org/10.1109/TEVC.2005.860762|
|Abstract:||Recent advances in evolutionary algorithms show that coevolutionary architectures are effective ways to broaden the use of traditional evolutionary algorithms. This paper presents a cooperative coevolutionary algorithm (CCEA) for multiobjective optimization, which applies the divide-and-conquer approach to decompose decision vectors into smaller components and evolves multiple solutions in the form of cooperative subpopulations. Incorporated with various features like archiving, dynamic sharing, and extending operator, the CCEA is capable of maintaining archive diversity in the evolution and distributing the solutions uniformly along the Pareto front. Exploiting the inherent parallelism of cooperative coevolution, the CCEA can be formulated into a distributed cooperative coevolutionary algorithm (DCCEA) suitable for concurrent processing that allows inter-communication of subpopulations residing in networked computers, and hence expedites the computational speed by sharing the workload among multiple computers. Simulation results show that the CCEA is competitive in finding the tradeoff solutions, and the DCCEA can effectively reduce the simulation runtime without sacrificing the performance of CCEA as the number of peers is increased. © 2006 IEEE.|
|Source Title:||IEEE Transactions on Evolutionary Computation|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 19, 2018
WEB OF SCIENCETM
checked on Sep 3, 2018
checked on Sep 22, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.