Znn3bq.jpeg
ÉÇÍ·´óѧº£Ñó¿ÆÑ§½ÓÊܵ÷¼Á
²é¿´: 634  |  »Ø¸´: 4
±¾Ìû²úÉú 1 ¸ö £¬µã»÷ÕâÀï½øÐв鿴
µ±Ç°Ö»ÏÔʾÂú×ãÖ¸¶¨Ìõ¼þµÄ»ØÌû£¬µã»÷ÕâÀï²é¿´±¾»°ÌâµÄËùÓлØÌû

peng_weishi

гæ (³õÈëÎÄ̳)

[½»Á÷] ²éwos

multi-objective particle optimization algorithm based on sharing-learning and dynamic cording distance

·¢×ÔСľ³æAndroid¿Í»§¶Ë

» ²ÂÄãϲ»¶

ÒÑÔÄ   »Ø¸´´ËÂ¥   ¹Ø×¢TA ¸øTA·¢ÏûÏ¢ ËÍTAºì»¨ TAµÄ»ØÌû

peng_weishi

гæ (³õÈëÎÄ̳)

ÒýÓûØÌû:
2Â¥: Originally posted by lzg020716 at 2016-06-01 22:09:30
Multi-objective particle optimization algorithm based on sharing-learning and dynamic crowding distance
×÷Õßeng, G (Peng, Guang) ; Fang, YW (Fang, Yang-Wang) ; Peng, WS (Peng, Wei-Shi) ; Chai, D ( ...

лл

·¢×ÔСľ³æAndroid¿Í»§¶Ë
3Â¥2016-06-01 22:50:18
ÒÑÔÄ   »Ø¸´´ËÂ¥   ¹Ø×¢TA ¸øTA·¢ÏûÏ¢ ËÍTAºì»¨ TAµÄ»ØÌû
²é¿´È«²¿ 5 ¸ö»Ø´ð

lzg020716

ľ³æ (ÎÄѧ̩¶·)

¡ï ¡ï ¡ï ¡ï ¡ï ¡ï ¡ï ¡ï ¡ï ¡ï
peng_weishi: ½ð±Ò+10, лл 2016-06-02 23:58:44
sunshan4379: LS-EPI+1, ¸ÐлӦÖú£¡ 2016-06-03 19:55:17
Multi-objective particle optimization algorithm based on sharing-learning and dynamic crowding distance
×÷Õßeng, G (Peng, Guang)[ 1 ] ; Fang, YW (Fang, Yang-Wang)[ 1 ] ; Peng, WS (Peng, Wei-Shi)[ 1 ] ; Chai, D (Chai, Dong)[ 1 ] ; Xu, Y (Xu, Yang)[ 1 ]
OPTIK
¾í: 127  ÆÚ: 12  Ò³: 5013-5020
DOI: 10.1016/j.ijleo.2016.02.045
³ö°æÄê: 2016
²é¿´ÆÚ¿¯ÐÅÏ¢
ÕªÒª
A multi-objective particle swarm optimization algorithm, based on share-learning and dynamic crowding distance (MOPSO-SDCD), is proposed to improve the convergence accuracy and keep the diversity of the Pareto optimal solutions. First, the sharing-learning factor is applied to modify the velocity updating formulas, which improves both the global search ability and local search accuracy of the algorithm. Meanwhile, Gaussian mutation and greedy strategy are adopted to update personal best position and external archive, which make the algorithm approximate the Pareto front quickly and avoid premature convergence. Finally, MOPSO-SDCD maintains the external archive based on dynamic crowding distance sorting strategy, whose purpose is boosting the diversity and distribution of Pareto optimal solutions. The ZDT series test functions are used to test the performance of MOPSO-SDCD and compare with other three typical algorithms. Simulation results verify the superiority and effectiveness of the proposed algorithm. (C) 2016 Elsevier GmbH. All rights reserved.
¹Ø¼ü´Ê
×÷Õ߹ؼü´Ê:Multi-objective optimization; Particle swarm optimization; Sharing-learning; Gaussian mutation; Dynamic crowding distance
KeyWords Plus:SWARM OPTIMIZER
×÷ÕßÐÅÏ¢
ͨѶ×÷ÕßµØÖ·: Peng, G (ͨѶ×÷Õß)
              Air Force Engn Univ, Aeronaut & Astronaut Engn Coll, Baling Rd 1, Xian, Peoples R China.
µØÖ·:
              [ 1 ] Air Force Engn Univ, Aeronaut & Astronaut Engn Coll, Baling Rd 1, Xian, Peoples R China
µç×ÓÓʼþµØÖ·:pg1445334307@163.com
³ö°æÉÌ
ELSEVIER GMBH, URBAN & FISCHER VERLAG, OFFICE JENA, P O BOX 100537, 07705 JENA, GERMANY
Àà±ð / ·ÖÀà
Ñо¿·½Ïò:Optics
Web of Science Àà±ð:Optics
ÎÄÏ×ÐÅÏ¢
ÎÄÏ×ÀàÐÍ:Article
ÓïÖÖ:English
Èë²ØºÅ: WOS:000374618900015
ISSN: 0030-4026
ÆÚ¿¯ÐÅÏ¢
Ŀ¼£º Current Contents Connect®
Impact Factor (Ó°ÏìÒò×Ó): Journal Citation Reports®
ÆäËûÐÅÏ¢
IDS ºÅ: DK0RC
Web of Science ºËÐĺϼ¯ÖÐµÄ "ÒýÓõIJο¼ÎÄÏ×": 18
Web of Science ºËÐĺϼ¯ÖÐµÄ "±»ÒýƵ´Î": 0
ÕÅ·É
2Â¥2016-06-01 22:09:30
ÒÑÔÄ   »Ø¸´´ËÂ¥   ¹Ø×¢TA ¸øTA·¢ÏûÏ¢ ËÍTAºì»¨ TAµÄ»ØÌû

Ðľ²_ÒÀÈ»

°æÖ÷ (ÖªÃû×÷¼Ò)

ÃüÖСù×¢¶¨

ÓÅÐã°æÖ÷ÓÅÐã°æÖ÷

ÒýÓûØÌû:
3Â¥: Originally posted by peng_weishi at 2016-06-01 22:50:18
лл
...

ÄãÓ¦¸Ã·¢ÇóÖúÌû£¬±ðÈ˲ÅÄÜ»ñµÃÓ¦ÖúÖ¸Êý
²»Íü³õÐÄ......
4Â¥2016-06-01 22:57:53
ÒÑÔÄ   »Ø¸´´ËÂ¥   ¹Ø×¢TA ¸øTA·¢ÏûÏ¢ ËÍTAºì»¨ TAµÄ»ØÌû

peng_weishi

гæ (³õÈëÎÄ̳)

ºÃµÄ£¬Ð»Ð»ÌáÐÑ¡£²»ÖªµÀ°¡

·¢×ÔСľ³æAndroid¿Í»§¶Ë
5Â¥2016-06-01 23:28:51
ÒÑÔÄ   »Ø¸´´ËÂ¥   ¹Ø×¢TA ¸øTA·¢ÏûÏ¢ ËÍTAºì»¨ TAµÄ»ØÌû
×î¾ßÈËÆøÈÈÌûÍÆ¼ö [²é¿´È«²¿] ×÷Õß »Ø/¿´ ×îºó·¢±í
[¿¼ÑÐ] È˹¤ÖÇÄÜ320µ÷¼Á08¹¤À໹Óлú»áÂð +18 Õñ¡ªTZ 2026-04-10 19/950 2026-04-14 10:34 by screening
[¿¼ÑÐ] ÉúÎïѧ308·ÖÇóµ÷¼Á£¨Ò»Ö¾Ô¸»ª¶«Ê¦´ó£©½ÓÊÜ¿çרҵ +10 ÏàÐűػá¹ââÍòÕ 2026-04-13 10/500 2026-04-14 09:28 by ´ø¿ÇµÄ¼¦µ°
[¿¼ÑÐ] 2026˶ʿµ÷¼Á_Äܶ¯_ºÓÄÏũҵ´óѧ +4 ºÓÄÏũҵ´óѧ-ÄÜ 2026-04-12 4/200 2026-04-13 22:01 by bljnqdcc
[¿¼ÑÐ] 305Çóµ÷¼Á +6 77Qi 2026-04-07 6/300 2026-04-12 02:30 by Çï¶¹²ËÑ¿
[¿¼ÑÐ] Ò»Ö¾Ô¸Ö£ÖÝ´óѧ 22408 305·ÖÇóµ÷¼Á +5 °²Ð¡Âúzzz 2026-04-08 5/250 2026-04-12 00:41 by À¶ÔÆË¼Óê
[¿¼ÑÐ] 22408µ÷¼Á315·Ö +3 zhuangyan123 2026-04-09 3/150 2026-04-12 00:25 by À¶ÔÆË¼Óê
[¿¼ÑÐ] Ò»Ö¾Ô¸Ïôó0856£¬306Çóµ÷¼Á +15 Bblinging 2026-04-11 15/750 2026-04-11 22:53 by 314126402
[¿¼ÑÐ] 087100³õÊÔ311Çóµ÷¼Á +4 ÈÎÑÅÇÙ 2026-04-09 4/200 2026-04-11 10:33 by zhq0425
[¿¼ÑÐ] 346£¬¹¤¿ÆÇóµ÷¼Á +3 moser233 2026-04-09 3/150 2026-04-11 10:04 by zhq0425
[¿¼ÑÐ] 337Çóµ÷¼Á +4 ÑÐs. 2026-04-10 4/200 2026-04-11 08:57 by zhq0425
[¿¼ÑÐ] µ÷¼Á +19 СÕÅZA 2026-04-10 20/1000 2026-04-10 22:08 by Öí»á·É
[¿¼ÑÐ] 284Çóµ÷¼Á +9 ÈÃÎÒÉϰ¶°É°¢Î÷ 2026-04-09 11/550 2026-04-10 19:18 by ¾¸jing
[¿¼ÑÐ] ³õÊÔ261 +3 AshtÉÙ 2026-04-10 6/300 2026-04-10 16:38 by AshtÉÙ
[¿¼ÑÐ] µ÷¼Á +19 2261744733 2026-04-08 19/950 2026-04-09 19:11 by vgtyfty
[¿¼ÑÐ] 0703»¯Ñ§Çóµ÷¼Á +21 ²»ÖªÃûµÄСئ 2026-04-08 21/1050 2026-04-09 18:55 by l_paradox
[¿¼ÑÐ] 367Çóµ÷¼Á +10 hffQAQ 2026-04-09 10/500 2026-04-09 18:06 by lijunpoly
[¿¼ÑÐ] »¯Ñ§¹¤³ÌÓë¼¼Êõרҵһ־Ը¹þ¹¤³Ì 291·ÖBÇø ¹ú¼Ò¼¶´ó´´¸ºÔðÈË ÓÐÒ»×÷ÂÛÎÄ +13 Emmy~ 2026-04-09 13/650 2026-04-09 14:47 by onlyÖÜ
[¿¼ÑÐ] 388Çóµ÷¼Á +6 ËÄ´¨ÍõÌÎ 2026-04-07 8/400 2026-04-08 00:17 by JourneyLucky
[¿¼ÑÐ] 313Çóµ÷¼Á +3 Ê®Áùʰ½ 2026-04-07 3/150 2026-04-07 23:20 by lbsjt
[¿¼ÑÐ] 259Çóµ÷¼Á +5 ¾Í°®³ÔÍÁ¶¹Ñ½Ñ½ 2026-04-07 5/250 2026-04-07 22:40 by JourneyLucky
ÐÅÏ¢Ìáʾ
ÇëÌî´¦ÀíÒâ¼û