Wang, L., Maciejewski, A. A., Siegel, H. J., and Roychowdhury, V. P., A Comparative Study of Five Parallel Genetic Algorithms Using The Travelling Salesman Problem, IPPS: 11th International Parallel Processing Symposium, IEEE Computer Society Press, 1998.  Home/Search   Document Details and Download   Summary   Related Articles

....results also shows that three out of four shared memory programs performs very well. In [5] the authors focuse solely on using Message Passing to implement PEA on two di#erent platforms, a cluster of HP workstations and a multiprocessor computer, in order to make a comparative evaluation. 6] and [7] compare di#erent models of PEA, such as coarse grained and fine grained, on a PC cluster and a parallel machine respectively. The result shows that the coarse grained model performs well for PC cluster regarding to calculation cost and parallel e#ciency. 3. Methodology . 3.1. Evolutionary ....

.... each processor performs selection and crossover operations independently on its own population and only exchanges individuals occasionally, the communication overheads required in this model are much less than in the others, making it the most popular method for implementing PEA, as can be seen in [7, 12, 13]. This paper, however, chooses to implement a synchronous master slave model because it is easy to implement and, unlike the other two methods, does not change the way the EA works. Coarse grained PEA performs migration whose e#ects are not yet completely understood and its di#erence from simple ....

Wang, L., Maciejewski, A. A., Siegel, H. J., and Roychowdhury, V. P., A Comparative Study of Five Parallel Genetic Algorithms Using The Travelling Salesman Problem, IPPS: 11th International Parallel Processing Symposium, IEEE Computer Society Press, 1998.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC