24小时热门版块排行榜    

查看: 334  |  回复: 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 核心合集中的 "引用的参考文献": 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 的主题更新
最具人气热帖推荐 [查看全部] 作者 回/看 最后发表
[考研] 335求调剂 +4 yuyu宇 2026-03-23 5/250 2026-03-23 23:49 by Txy@872106
[考研] 一志愿北京化工大学 070300 学硕 336分 求调剂 +7 vv迷 2026-03-22 7/350 2026-03-23 23:44 by Txy@872106
[考研] 299求调剂 +5 某某某某位 2026-03-21 5/250 2026-03-23 23:36 by 热情沙漠
[考研] 081700 调剂 267分 +7 迷人的哈哈 2026-03-23 7/350 2026-03-23 23:19 by 星空星月
[考研] 材料/农业专业,07/08开头均可,过线就行 +3 呵唔哦豁 2026-03-23 4/200 2026-03-23 22:30 by 汪!?!
[考研] 一志愿中南大学化学学硕0703总分337求调剂 +5 niko- 2026-03-22 5/250 2026-03-23 22:01 by fuyu_
[考研] 291求调剂 +5 孅華 2026-03-22 5/250 2026-03-23 09:20 by haoshis
[考研] 求调剂 +7 Auroracx 2026-03-22 7/350 2026-03-22 12:38 by 素颜倾城1988
[考研] 354求调剂 +7 Tyoumou 2026-03-18 10/500 2026-03-22 11:11 by 人来盛
[考研] 一志愿东华大学控制学硕320求调剂 +3 Grand777 2026-03-21 3/150 2026-03-21 19:23 by 简之-
[考研] 【考研调剂】化学专业 281分,一志愿四川大学,诚心求调剂 +11 吃吃吃才有意义 2026-03-19 11/550 2026-03-21 18:23 by 学员8dgXkO
[考研] 301求调剂 +10 yy要上岸呀 2026-03-17 10/500 2026-03-21 03:14 by JourneyLucky
[考研] 085700资源与环境308求调剂 +12 墨墨漠 2026-03-18 13/650 2026-03-21 01:42 by JourneyLucky
[考研] 一志愿 西北大学 ,070300化学学硕,总分287,双非一本,求调剂。 +3 晨昏线与星海 2026-03-18 3/150 2026-03-21 00:46 by JourneyLucky
[考研] 22408 344分 求调剂 一志愿 华电计算机技术 +4 solanXXX 2026-03-20 4/200 2026-03-20 23:49 by alg094825
[考研] 一志愿 西北大学 ,070300化学学硕,总分287,双非一本,求调剂。 +4 晨昏线与星海 2026-03-19 4/200 2026-03-20 22:15 by JourneyLucky
[考研] 材料与化工 322求调剂 +4 然11 2026-03-19 4/200 2026-03-20 22:12 by luoyongfeng
[考研] 一志愿苏州大学材料求调剂,总分315(英一) +5 sbdksD 2026-03-19 5/250 2026-03-20 22:10 by luoyongfeng
[考研] 353求调剂 +3 拉钩不许变 2026-03-20 3/150 2026-03-20 19:56 by JourneyLucky
[考研] 0703化学调剂 +5 pupcoco 2026-03-17 8/400 2026-03-19 13:58 by houyaoxu
信息提示
请填处理意见