|
Vestnik Yuzhno-Ural'skogo Universiteta. Seriya Matematicheskoe Modelirovanie i Programmirovanie, 2011, Issue 10, Pages 63–70
(Mi vyuru186)
|
|
|
|
Computer Sciences
Efficiency research of CUDA application for Pareto set reconstruction using particle swarm optimization
A. E. Antukh, A. P. Karpenko, A. S. Semenikhin Bauman Moscow State Technical University (Russia, Moscow)
Abstract:
There are a lot of practical cases that requires Pareto set construction to solve multi-objective optimization task. This article is devoted to observe a combination of well-known non-dominated sorting method with particle swarm optimization algorithm. Authors set a goal to research efficiency of the new combined method on graphical computational unit with CUDA architecture.
Keywords:
particle swarm optimization, GPU, Pareto set.
Received: 04.07.2011
Citation:
A. E. Antukh, A. P. Karpenko, A. S. Semenikhin, “Efficiency research of CUDA application for Pareto set reconstruction using particle swarm optimization”, Vestnik YuUrGU. Ser. Mat. Model. Progr., 2011, no. 10, 63–70
Linking options:
https://www.mathnet.ru/eng/vyuru186 https://www.mathnet.ru/eng/vyuru/y2011/i10/p63
|
Statistics & downloads: |
Abstract page: | 174 | Full-text PDF : | 189 | References: | 35 |
|