| ²é¿´: 616 | »Ø¸´: 4 | |||
| ±¾Ìû²úÉú 1 ¸ö £¬µã»÷ÕâÀï½øÐв鿴 | |||
peng_weishiгæ (³õÈëÎÄ̳)
|
[½»Á÷]
²éwos
|
||
|
multi-objective particle optimization algorithm based on sharing-learning and dynamic cording distance ·¢×ÔСľ³æAndroid¿Í»§¶Ë |
» ²ÂÄãϲ»¶
±¾ÈË¿¼085602 »¯Ñ§¹¤³Ì ר˶
ÒѾÓÐ23È˻ظ´
311Çóµ÷¼Á
ÒѾÓÐ9È˻ظ´
Çóµ÷¼ÁԺУÐÅÏ¢
ÒѾÓÐ4È˻ظ´
085600²ÄÁÏÓ뻯¹¤306
ÒѾÓÐ4È˻ظ´
286Çóµ÷¼Á
ÒѾÓÐ10È˻ظ´
328Çóµ÷¼Á£¬Ó¢ÓïÁù¼¶551£¬ÓпÆÑоÀú
ÒѾÓÐ9È˻ظ´
Ò»Ö¾Ô¸±±¾©»¯¹¤´óѧ070300 ѧ˶336Çóµ÷¼Á
ÒѾÓÐ4È˻ظ´
286·ÖÈ˹¤ÖÇÄÜרҵÇëÇóµ÷¼ÁÔ¸Òâ¿ç¿¼£¡
ÒѾÓÐ8È˻ظ´
×ÊÔ´Óë»·¾³ µ÷¼ÁÉêÇë(333·Ö)
ÒѾÓÐ5È˻ظ´
280Çóµ÷¼Á
ÒѾÓÐ12È˻ظ´
lzg020716
ľ³æ (ÎÄѧ̩¶·)
- Ó¦Öú: 222 (´óѧÉú)
- ½ð±Ò: 17646.8
- É¢½ð: 108
- ºì»¨: 48
- ɳ·¢: 2
- Ìû×Ó: 63340
- ÔÚÏß: 2551.5Сʱ
- ³æºÅ: 279196
- ×¢²á: 2006-09-16
- ÐÔ±ð: GG
- רҵ: Ö²ÎïÉúÀíÓëÉú»¯
¡ï ¡ï ¡ï ¡ï ¡ï ¡ï ¡ï ¡ï ¡ï ¡ï
peng_weishi: ½ð±Ò+10, лл 2016-06-02 23:58:44
sunshan4379: LS-EPI+1, ¸ÐлӦÖú£¡ 2016-06-03 19:55:17
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
peng_weishi
гæ (³õÈëÎÄ̳)
- Ó¦Öú: 0 (Ó×¶ùÔ°)
- ½ð±Ò: 1186.3
- É¢½ð: 50
- Ìû×Ó: 48
- ÔÚÏß: 24.5Сʱ
- ³æºÅ: 3467243
- ×¢²á: 2014-10-11
- ÐÔ±ð: MM
- רҵ: È˹¤ÖÇÄÜÓë֪ʶ¹¤³Ì
3Â¥2016-06-01 22:50:18
Ðľ²_ÒÀÈ»
°æÖ÷ (ÖªÃû×÷¼Ò)
ÃüÖСù×¢¶¨
- Ó¦Öú: 327 (´óѧÉú)
- ¹ó±ö: 2.396
- ½ð±Ò: 77406.9
- É¢½ð: 13395
- ºì»¨: 211
- ɳ·¢: 98
- Ìû×Ó: 8367
- ÔÚÏß: 2109.5Сʱ
- ³æºÅ: 3472728
- ×¢²á: 2014-10-13
- ÐÔ±ð: GG
- רҵ: ×ÊÔ´»¯¹¤
- ¹ÜϽ: ¼ìË÷֪ʶ

4Â¥2016-06-01 22:57:53
peng_weishi
гæ (³õÈëÎÄ̳)
- Ó¦Öú: 0 (Ó×¶ùÔ°)
- ½ð±Ò: 1186.3
- É¢½ð: 50
- Ìû×Ó: 48
- ÔÚÏß: 24.5Сʱ
- ³æºÅ: 3467243
- ×¢²á: 2014-10-11
- ÐÔ±ð: MM
- רҵ: È˹¤ÖÇÄÜÓë֪ʶ¹¤³Ì
5Â¥2016-06-01 23:28:51













»Ø¸´´ËÂ¥
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 ]