Parallel evolutionary algorithms on graphics processing unit
Proceedings of the 2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005
Institute of Electrical and Electronics Engineers
Evolutionary Algorithms (EAs) are effective and robust methods for solving many practical problems such as feature selection, electrical circuits synthesis, and data mining. However, they may execute for a long time for some difficult problems, because several fitness evaluations must be performed. A promising approach to overcome this limitation is to parallelize these algorithms. In this paper, we propose to implement a parallel EA on consumer-level graphics cards. We perform experiments to compare our parallel EA with an ordinary EA and demonstrate that the former is much more effective than the latter. Since consumer-level graphics cards are available in ubiquitous personal computers and these computers are easy to use and manage, more people will be able to use our parallel algorithm to solve their problems encountered in real-world applications.
Copyright © 2005 IEEE. Access to external full text or publisher's version may require subscription.
Paper presented at the 2005 IEEE Congress on Evolutionary Computation (IEEE CEC 2005), 2-5 September 2005, Edinburgh, Scotland.
ISBN of the source publication: 0780393635
Wong, M.-L., Wong, T.-T., & Fok, K.-L. (2005). Parallel evolutionary algorithms on graphics processing unit. In Proceedings of the 2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005 (pp. 2286-2293). Piscataway: Institute of Electrical and Electronics Engineers. doi: 10.1109/CEC.2005.1554979