| ²é¿´: 336 | »Ø¸´: 2 | |||
| ±¾Ìû²úÉú 1 ¸ö LS-EPI £¬µã»÷ÕâÀï½øÐв鿴 | |||
baroshiľ³æ (ÕýʽдÊÖ)
|
[ÇóÖú]
°ïæ²éһƪÎÄÕµÄSCIºÅ£¬Ð»Ð»¡£
|
||
|
A novel selection evolutionary strategy for constrained optimization [ ·¢×ÔÊÖ»ú°æ http://muchong.com/3g ] |
» ²ÂÄãϲ»¶
085602 307·Ö Çóµ÷¼Á
ÒѾÓÐ3È˻ظ´
340Çóµ÷¼Á
ÒѾÓÐ4È˻ظ´
085602 »¯¹¤×¨Ë¶ 338·Ö Çóµ÷¼Á
ÒѾÓÐ8È˻ظ´
328Çóµ÷¼Á
ÒѾÓÐ6È˻ظ´
Çóµ÷¼Á
ÒѾÓÐ6È˻ظ´
Ò»Ö¾Ô¸ Î÷±±´óѧ ×Ü·Ö282 Ó¢ÓïÒ»62 Çóµ÷¼Á
ÒѾÓÐ8È˻ظ´
0703»¯Ñ§
ÒѾÓÐ4È˻ظ´
289Çóµ÷¼Á
ÒѾÓÐ6È˻ظ´
291Çóµ÷¼Á
ÒѾÓÐ17È˻ظ´
²ÄÁÏÓ뻯¹¤085600£¬×Ü·Ö304£¬±¾¿ÆÓÐÁ½Æªsci²ÎÓ룬Çóµ÷¼Á
ÒѾÓÐ12È˻ظ´

sunshan4379
°æÖ÷ (ÎÄ̳¾«Ó¢)
- LS-EPI: 131
- Ó¦Öú: 218 (´óѧÉú)
- ¹ó±ö: 7.08
- ½ð±Ò: 129140
- É¢½ð: 57852
- ºì»¨: 419
- ɳ·¢: 1036
- Ìû×Ó: 17124
- ÔÚÏß: 4575.2Сʱ
- ³æºÅ: 2420830
- ×¢²á: 2013-04-16
- ÐÔ±ð: GG
- רҵ: Â߼ѧ
- ¹ÜϽ: ¼ìË÷֪ʶ
¡¾´ð°¸¡¿Ó¦Öú»ØÌû
¡ï ¡ï ¡ï ¡ï ¡ï
¸Ðл²ÎÓ룬ӦÖúÖ¸Êý +1
baroshi: ½ð±Ò+5, ¡ï¡ï¡ï¡ï¡ï×î¼Ñ´ð°¸ 2014-09-21 18:30:01
oven1986: LS-EPI+1, ¸ÐлӦÖú£¡ 2014-09-22 19:30:23
¸Ðл²ÎÓ룬ӦÖúÖ¸Êý +1
baroshi: ½ð±Ò+5, ¡ï¡ï¡ï¡ï¡ï×î¼Ñ´ð°¸ 2014-09-21 18:30:01
oven1986: LS-EPI+1, ¸ÐлӦÖú£¡ 2014-09-22 19:30:23
|
A novel selection evolutionary strategy for constrained optimization ×÷Õß:Jiao, LC (Jiao, LiCheng)[ 1 ] ; Li, L (Li, Lin)[ 1 ] ; Shang, RH (Shang, RongHua)[ 1 ] ; Liu, F (Liu, Fang)[ 1 ] ; Stolkin, R (Stolkin, Rustam)[ 2 ] INFORMATION SCIENCES ¾í: 239 Ò³: 122-141 DOI: 10.1016/j.ins.2013.03.002 ³ö°æÄê: AUG 1 2013 ²é¿´ÆÚ¿¯ÐÅÏ¢ ÕªÒª The existence of infeasible solutions makes it very difficult to handle constrained optimization problems (COPS) in a way that ensures efficient, optimal and constraint-satisfying convergence. Although further optimization from feasible solutions will typically lead in a direction that generates further feasible solutions, certain infeasible solutions can also provide useful information about the optimal direction of improvement for the objective function. How well an algorithm makes use of these two solutions determines its performance on COPs. This paper proposes a novel selection evolutionary strategy (NSES) for constrained optimization. A self-adaptive selection method is introduced to exploit both informative infeasible and feasible solutions from a perspective of combining feasibility with multi-objective problem (MOP) techniques. Since the global optimal solution of a COP is a feasible non-dominated solution, both non-dominated solutions with low constraint violation and feasible ones with low objective values are beneficial to an evolution process. Thus, the exploration and exploitation of both of these two kinds of solutions are preferred during the selection procedure. Several theorems and properties are given to prove the above assertion. Furthermore, the performance of our method is evaluated using 22 well-known benchmark functions. Experimental results show that the proposed method outperforms state-of-the-art algorithms in terms of the speed of finding feasible solutions and the stability of converging to global optimal solutions. In particular, when dealing with problems that have zero feasibility ratios and more than one active constraint, our method provides feasible solutions within fewer fitness evaluations (FES) and converges to the optimal solutions more reliably than other popular methods from the literature. (C) 2013 Elsevier Inc. All rights reserved. ¹Ø¼ü´Ê ×÷Õ߹ؼü´Ê:Non-dominated solution; Evolutionary algorithm; Constrained optimization; Multi-objective optimization; Constraint handling KeyWords Plus:ADAPTIVE PENALTY STRATEGY; GENETIC ALGORITHMS; MULTIOBJECTIVE OPTIMIZATION; COVERING ARRAYS; SEARCH; FORMULATION; OBJECTIVES; RANKING; SCHEME ×÷ÕßÐÅÏ¢ ͨѶ×÷ÕßµØÖ·: Li, L (ͨѶ×÷Õß) ÏÔʾÔöÇ¿×éÖ¯ÐÅÏ¢µÄÃû³Æ Xidian Univ, Minist Educ China, Key Lab Intelligent Percept & Image Understanding, Xian, Peoples R China. µØÖ·: ÏÔʾÔöÇ¿×éÖ¯ÐÅÏ¢µÄÃû³Æ [ 1 ] Xidian Univ, Minist Educ China, Key Lab Intelligent Percept & Image Understanding, Xian, Peoples R China ÏÔʾÔöÇ¿×éÖ¯ÐÅÏ¢µÄÃû³Æ [ 2 ] Univ Birmingham, Sch Comp Sci, Birmingham B15 2TT, W Midlands, England µç×ÓÓʼþµØÖ·:xdlinli86@163.com »ù½ð×ÊÖúÖÂл »ù½ð×ÊÖú»ú¹¹ ÊÚȨºÅ National Natural Science Foundation of China 61001202 61003199 China Post-Doctoral Science Foundation 201104658 20090451369 National Research Foundation for the Doctoral Program of Higher Education of China 20100203120008 200807010003 0090203120016 Fund for Foreign Scholars in University Research and Teaching Programs (the 111 Project) B07048 Program for Cheung Kong Scholars and Innovative Research Team in University IRT1170 ²é¿´»ù½ð×ÊÖúÐÅÏ¢ ³ö°æÉÌ ELSEVIER SCIENCE INC, 360 PARK AVE SOUTH, NEW YORK, NY 10010-1710 USA Àà±ð / ·ÖÀà Ñо¿·½Ïò:Computer Science Web of Science Àà±ð:Computer Science, Information Systems ÎÄÏ×ÐÅÏ¢ ÎÄÏ×ÀàÐÍ:Article ÓïÖÖ:English Èë²ØºÅ: WOS:000319538500009 ISSN: 0020-0255 ÆÚ¿¯ÐÅÏ¢ Impact Factor (Ó°ÏìÒò×Ó): Journal Citation Reports® ÆäËûÐÅÏ¢ IDS ºÅ: 152NN Web of Science ºËÐĺϼ¯ÖÐµÄ "ÒýÓõIJο¼ÎÄÏ×": 49 Web of Science ºËÐĺϼ¯ÖÐµÄ "±»ÒýƵ´Î": 1 |

2Â¥2014-09-21 18:02:32
sunshan4379
°æÖ÷ (ÎÄ̳¾«Ó¢)
- LS-EPI: 131
- Ó¦Öú: 218 (´óѧÉú)
- ¹ó±ö: 7.08
- ½ð±Ò: 129140
- É¢½ð: 57852
- ºì»¨: 419
- ɳ·¢: 1036
- Ìû×Ó: 17124
- ÔÚÏß: 4575.2Сʱ
- ³æºÅ: 2420830
- ×¢²á: 2013-04-16
- ÐÔ±ð: GG
- רҵ: Â߼ѧ
- ¹ÜϽ: ¼ìË÷֪ʶ

3Â¥2014-09-21 18:02:45














»Ø¸´´ËÂ¥