Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
The MOSIX Distributed Operating System: Load Balancing for UNIX
The MOSIX Distributed Operating System: Load Balancing for UNIX
Distributed Genetic Algorithms
Proceedings of the 3rd International Conference on Genetic Algorithms
Serial and Parallel Genetic Algorithms as Function Optimizers
Proceedings of the 5th International Conference on Genetic Algorithms
Optimization Using Distributed Genetic Algorithms
PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
Implementing the Genetic Algorithm on Transputer Based Parallel Processing Systems
PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
Hi-index | 0.00 |
To what extent is distribution beneficial to the search quality and computational resources used by a genetic algorithm execution? Most distributed genetic algorithms rely on communicating genetic information, in the form of individual solutions, between concurrently evolving populations. Another way of effectively using the additional information generated by the parallel executions is the profiling approach to communication, where populations decide whether their own performance is satisfactory, relative to the global average improvement curve. Thus, communication between populations takes the form of improvement histories. This is shown to improve on the traditional communication approach, in terms of both solution quality and execution performance.