±±¾©Ê¯ÓÍ»¯¹¤Ñ§Ôº2026ÄêÑо¿ÉúÕÐÉú½ÓÊÕµ÷¼Á¹«¸æ
²é¿´: 336  |  »Ø¸´: 2
±¾Ìû²úÉú 1 ¸ö LS-EPI £¬µã»÷ÕâÀï½øÐв鿴

baroshi

ľ³æ (ÕýʽдÊÖ)

[ÇóÖú] °ïæ²éһƪÎÄÕµÄSCIºÅ£¬Ð»Ð»¡£

A novel selection evolutionary strategy for constrained optimization

[ ·¢×ÔÊÖ»ú°æ http://muchong.com/3g ]
»Ø¸´´ËÂ¥

» ²ÂÄãϲ»¶

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

sunshan4379

°æÖ÷ (ÎÄ̳¾«Ó¢)

ÓÅÐã°æÖ÷ÓÅÐã°æÖ÷ÎÄÏ׽ܳö¹±Ï×ÓÅÐã°æÖ÷

¡¾´ð°¸¡¿Ó¦Öú»ØÌû

¡ï ¡ï ¡ï ¡ï ¡ï
¸Ðл²ÎÓ룬ӦÖúÖ¸Êý +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
ÒÑÔÄ   »Ø¸´´ËÂ¥   ¹Ø×¢TA ¸øTA·¢ÏûÏ¢ ËÍTAºì»¨ TAµÄ»ØÌû

sunshan4379

°æÖ÷ (ÎÄ̳¾«Ó¢)

ÓÅÐã°æÖ÷ÓÅÐã°æÖ÷ÎÄÏ׽ܳö¹±Ï×ÓÅÐã°æÖ÷

¡¾´ð°¸¡¿Ó¦Öú»ØÌû

¼ìË÷ºÅ  WOS:000319538500009
·Çµ­²´ÎÞÒÔÃ÷Ö¾£¬·ÇÄþ¾²ÎÞÒÔÖÂÔ¶
3Â¥2014-09-21 18:02:45
ÒÑÔÄ   »Ø¸´´ËÂ¥   ¹Ø×¢TA ¸øTA·¢ÏûÏ¢ ËÍTAºì»¨ TAµÄ»ØÌû
Ïà¹Ø°æ¿éÌø×ª ÎÒÒª¶©ÔÄÂ¥Ö÷ baroshi µÄÖ÷Ìâ¸üÐÂ
×î¾ßÈËÆøÈÈÌûÍÆ¼ö [²é¿´È«²¿] ×÷Õß »Ø/¿´ ×îºó·¢±í
[¿¼ÑÐ] 292Çóµ÷¼Á +13 ¶ì¶ì¶ì¶î¶î¶î¶î¶ 2026-03-25 14/700 2026-03-27 15:40 by caszguilin
[¿¼ÑÐ] 085600²ÄÁÏÓ뻯¹¤µ÷¼Á +10 A-¶ßÀ²ZÃÎ 2026-03-23 16/800 2026-03-27 15:13 by caszguilin
[¿¼ÑÐ] 0703Ò»Ö¾Ô¸9£¬³õÊԳɼ¨£º338£¬ËÄÁù¼¶Òѹý£¬ÓпÆÑо­Àú£¬Çóµ÷¼Á£¡ +3 Zuhui0306 2026-03-25 3/150 2026-03-27 14:09 by shangxh
[¿¼ÑÐ] 305Çóµ÷¼Á +5 ÍÛ¬¿¨¿â 2026-03-26 5/250 2026-03-27 14:01 by laoshidan
[¿¼ÑÐ] 22408 359·Öµ÷¼Á +3 Qshers 2026-03-27 3/150 2026-03-27 12:22 by wxiongid
[¿¼ÑÐ] Ò»Ö¾Ô¸211£¬335·Ö£¬0856£¬Çóµ÷¼ÁԺУºÍµ¼Ê¦ +4 Çã____Ïô 2026-03-27 5/250 2026-03-27 11:52 by zhshch
[¿¼ÑÐ] 303Çóµ÷¼Á +7 °²ÒäÁé 2026-03-22 8/400 2026-03-27 11:46 by sanrepian
[¿¼ÑÐ] Çóµ÷¼Á Ò»Ö¾Ô¸ ±¾¿Æ ±±¿Æ´ó »¯Ñ§ 343 +6 13831862839 2026-03-24 7/350 2026-03-26 22:57 by ²»³Ôô~µÄ؈
[¿¼ÑÐ] 286Çóµ÷¼Á +13 Faune 2026-03-21 13/650 2026-03-26 19:52 by peike
[¿¼ÑÐ] 085600 ²ÄÁÏÓ뻯¹¤ 329·ÖÇóµ÷¼Á +9 Mr. Z 2026-03-25 9/450 2026-03-26 10:36 by baoball
[¿¼ÑÐ] »¯Ñ§µ÷¼ÁÒ»Ö¾Ô¸ÉϺ£½»Í¨´óѧ336·Ö-±¾¿ÆÉϺ£211 +4 СÓã°®Óлú 2026-03-25 4/200 2026-03-26 10:19 by aa331100
[¿¼ÑÐ] 303Çóµ÷¼Á +6 À¶É½Ô 2026-03-25 6/300 2026-03-25 22:47 by 418490947
[¿¼ÑÐ] 0854µç×ÓÐÅÏ¢Çóµ÷¼Á +7 ¦Á____ 2026-03-22 9/450 2026-03-25 13:37 by ¦Á____
[¿¼ÑÐ] ²ÄÁÏ¿¼Ñе÷¼ÁÉú +3 »ÆÁ»Ò»ÃÎǧÄê 2026-03-24 3/150 2026-03-24 17:00 by barlinike
[¿¼ÑÐ] Ò»Ö¾Ô¸ºÓ±±¹¤Òµ´óѧ0817»¯¹¤278·ÖÇóµ÷¼Á +7 jhybd 2026-03-23 12/600 2026-03-24 09:03 by jhybd
[¿¼ÑÐ] »·¾³Ñ§Ë¶288Çóµ÷¼Á +8 ƤƤƤ123456 2026-03-22 8/400 2026-03-23 23:47 by ÈÈÇéɳĮ
[¿¼ÑÐ] Ò»Ö¾Ô¸¹ú¿Æ¹ý³ÌËù081700£¬274Çóµ÷¼Á +3 ÈýË®ÑÐ0Ë®Á¢·½ 2026-03-23 3/150 2026-03-23 23:11 by MajorWen
[¿¼ÑÐ] 308Çóµ÷¼Á +3 īīĮ 2026-03-21 3/150 2026-03-22 16:54 by i_cooler
[¿¼ÑÐ] Çóµ÷¼ÁԺУÐÅÏ¢ +6 CX 330 2026-03-21 6/300 2026-03-22 15:25 by ÎÞи¿É»÷111
[¿¼ÑÐ] Ò»Ö¾Ô¸ÖØÇì´óѧ085700×ÊÔ´Óë»·¾³×Ü·Ö308Çóµ÷¼Á +7 īīĮ 2026-03-20 7/350 2026-03-21 16:36 by barlinike
ÐÅÏ¢Ìáʾ
ÇëÌî´¦ÀíÒâ¼û