Please use this identifier to cite or link to this item:
|Title:||A distributed co-evolutionary particle Swarm Optimization Algorithm|
|Citation:||Liu, D.S., Tan, K.C., Ho, W.K. (2007). A distributed co-evolutionary particle Swarm Optimization Algorithm. 2007 IEEE Congress on Evolutionary Computation, CEC 2007 : 3831-3838. ScholarBank@NUS Repository. https://doi.org/10.1109/CEC.2007.4424970|
|Abstract:||This paper introduces a distributed co-evolutionary particle swarm optimization algorithm (DCPSO). In DCPSO, the population is decomposed into the subpopulations that are each responsible for optimizing one parameter, and co-evolve in a competitive manner. Such co-evolution mechanism with both cooperation and competition are designed to be effective and efficient in solving multi-objective (MO) problems under distributed computation. The competition mechanism also indirectly helps DCPSO to overcome the fault-tolerance constraint in distributed computation. DCPSO shows substantial speedup from non-distributed version by sharing workload among computational nodes. In addition, a dynamic load balancing mechanism is used to further speed up the total runtime by minimizing the amount of idle time in each node. © 2007 IEEE.|
|Source Title:||2007 IEEE Congress on Evolutionary Computation, CEC 2007|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 19, 2018
WEB OF SCIENCETM
checked on Apr 3, 2018
checked on May 18, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.