• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

Çмú´ëȸ ÇÁ·Î½Ãµù

Ȩ Ȩ > ¿¬±¸¹®Çå > Çмú´ëȸ ÇÁ·Î½Ãµù > Çѱ¹ÀÎÅͳÝÁ¤º¸ÇÐȸ Çмú¹ßÇ¥´ëȸ > 2018³âµµ ÀÎÅͳÝÁ¤º¸ÇÐȸ Ãß°èÇмú¹ßÇ¥´ëȸ

2018³âµµ ÀÎÅͳÝÁ¤º¸ÇÐȸ Ãß°èÇмú¹ßÇ¥´ëȸ

Current Result Document : 4 / 4

ÇѱÛÁ¦¸ñ(Korean Title) ÇÏÀ̺긮µå ºÐÇØ ¹× º´·Ä ´Ù¸ñÀû particle swarm optimization ¾Ë°í¸®Áò
¿µ¹®Á¦¸ñ(English Title) A Hybrid Decomposition and Parallel Multi-Objective Particle Swarm Optimization Algorithm
ÀúÀÚ(Author) ÆÇ´õºó   ÀÌÀç¿Ï   µ¢Ã¢¼­   ź½¬Áö¿¡   ¸®¸®½Ã¿£   Debin Fan   Jaewan Lee   Changshou Deng   Xujie Tan   Lixian Li  
¿ø¹®¼ö·Ïó(Citation) VOL 19 NO. 02 PP. 0305 ~ 0306 (2018. 11)
Çѱ۳»¿ë
(Korean Abstract)
¿µ¹®³»¿ë
(English Abstract)
How to achieve Multi-Objective optimization has always been the focus of research, this paper proposes a hybrid decomposition and parallel multi-objective particle swarm optimization algorithm. The algorithm uses Chebyshev decomposition method to an aggregate multi-objective problem into several single-objective problems, and improves the velocity and position updating formula of each single-target problem particle, also improves the efficiency of algorithm search to Pareto solution set. At the same time, it accelerates the process under the distributed computing framework and achieves good results. By verifying the performance of a series of two target test functions, the validity of the algorithm is proved. This algorithm provides a new method for solving Multi-Objective optimization problems.
Å°¿öµå(Keyword)
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå