Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Parallel Optimization: Theory, Algorithms and Applications
Parallel Optimization: Theory, Algorithms and Applications
Evolutionary Optimization Versus Particle Swarm Optimization: Philosophy and Performance Differences
EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
Efficient and Adaptive Epidemic-Style Protocols for Reliable and Scalable Multicast
IEEE Transactions on Parallel and Distributed Systems
A novel population initialization method for accelerating evolutionary algorithms
Computers & Mathematics with Applications
Multi-objective particle swarm optimization on computer grids
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Peer-to-peer evolutionary algorithms with adaptive autonomous selection
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Soft Computing - A Fusion of Foundations, Methodologies and Applications - Special issue (1143 - 1198) " Distributed Bioinspired Algorithms"; Guest editors: F. Fernández de Vega, E. Cantú-Paz
Parallel Approaches for Multiobjective Optimization
Multiobjective Optimization
Distributed computing of Pareto-optimal solutions with evolutionary algorithms
EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
Considerations in engineering parallel multiobjective evolutionary algorithms
IEEE Transactions on Evolutionary Computation
A peer-to-peer approach to genetic programming
EuroGP'11 Proceedings of the 14th European conference on Genetic programming
Hi-index | 0.00 |
Peer-to-peer based distributed computing environments can be expected to be dynamic to greater of lesser degree. While node losses will not usually lead to catastrophic failure of a population-based optimisation algorithm, such as particle swarm optimisation, performance will be degraded unless the lost computational power is replaced. When resources are replaced, one must consider how to utilise newly available nodes as well as the loss of existing nodes. In order to take advantage of newly available nodes, new particles must be generated to populate them. This paper proposes two methods of generating new particles during algorithm execution and compares the performance of each approach, then investigates a hybridised approach incorporating both mechanisms.