Geodesic
Efficiency research of CUDA application for Pareto set reconstruction using particle swarm optimization
Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematičeskoe modelirovanie i programmirovanie, no. 10 (2011), pp. 63-70 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

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. 
@article{VYURU_2011_10_a6,
     author = {A. E. Antukh and A. P. Karpenko and A. S. Semenikhin},
     title = {Efficiency research of {CUDA} application for {Pareto} set reconstruction using particle swarm optimization},
     journal = {Vestnik \^U\v{z}no-Uralʹskogo gosudarstvennogo universiteta. Seri\^a, Matemati\v{c}eskoe modelirovanie i programmirovanie},
     pages = {63--70},
     year = {2011},
     number = {10},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VYURU_2011_10_a6/}
}
TY  - JOUR
AU  - A. E. Antukh
AU  - A. P. Karpenko
AU  - A. S. Semenikhin
TI  - Efficiency research of CUDA application for Pareto set reconstruction using particle swarm optimization
JO  - Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematičeskoe modelirovanie i programmirovanie
PY  - 2011
SP  - 63
EP  - 70
IS  - 10
UR  - http://geodesic.mathdoc.fr/item/VYURU_2011_10_a6/
LA  - ru
ID  - VYURU_2011_10_a6
ER  - 
%0 Journal Article
%A A. E. Antukh
%A A. P. Karpenko
%A A. S. Semenikhin
%T Efficiency research of CUDA application for Pareto set reconstruction using particle swarm optimization
%J Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematičeskoe modelirovanie i programmirovanie
%D 2011
%P 63-70
%N 10
%U http://geodesic.mathdoc.fr/item/VYURU_2011_10_a6/
%G ru
%F VYURU_2011_10_a6
A. E. Antukh; A. P. Karpenko; A. S. Semenikhin. Efficiency research of CUDA application for Pareto set reconstruction using particle swarm optimization. Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematičeskoe modelirovanie i programmirovanie, no. 10 (2011), pp. 63-70. http://geodesic.mathdoc.fr/item/VYURU_2011_10_a6/

[1] “GPU calculations” (accessed 13.12.2010)

[2] (accessed 13.12.2010)

[3] Karpenko A. P., Seliverstov E. U., “Global non-conditional swarm optimizaion using CUDA”, Nauka i obrazovanie: jelektronnoe nauchno-tehnicheskoe izdanie, 2010, no. 4

[4] Shtojer R., Multimodal optimization. Theory, computing and application, M., 1992, 504 pp. | MR

[5] Karpenko A. P., Seliverstov E. U., “Global optimization using partical swarm method. Overview”, Informacionnye tehnologii, 2010, no. 2, 25–34 | MR

[6] X. Hu, R. Eberhart, “Multiobjective optimization using dynamic neighborhood particle swarm optimization”, World Congress on Computational Inelligence (2002), 1677–1681

[7] N. Shinvas, K. Deb, “Multiobjective optimization using nondominated sorting in genetic algorithms”, Evolutionary Computation, 2 (1994), 221–248 | DOI

[8] Antuh A. E., Semenihin A. S., Hasanova R. V., “Pareto set construction usgin PSO on GPU with CUDA library”, Nauchnyj servis v seti Internet: superkomp'juternye centry i zadachi, tr. mezhdunar. superkomp'juter. konf. (21–26 sentjabrja 2009 g., g. Novorossijsk), M., 2010, 274–280 | MR

[9] Frolov V., “CUDA Introduction” (accessed 13.12.2010)