Efficiency research of CUDA application for Pareto set reconstruction using particle swarm optimization
Автор: Antukh Alexander Eduardovich, Karpenko Anatoliy Pavlovich, Semenikhin Artyom Sergeevich
Рубрика: Программирование
Статья в выпуске: 37 (254), 2011 года.
Бесплатный доступ
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.
Particle swarm optimization, gpu, pareto set
Короткий адрес: https://sciup.org/147159113
IDR: 147159113
Статья научная