发布求助
文献互助 智能选刊 最新文献

2009 IEEE Congress on Evolutionary Computation最新文献

筛选
英文 中文
Optimal placement of capacitor banks in distorted electrical distribution network based on a constrained multi-objective immune algorithm 基于约束多目标免疫算法的畸变配电网电容器组优化配置
2009 IEEE Congress on Evolutionary Computation Pub Date : 2016-07-01 DOI: 10.1109/CEC.2016.7744288
H. N. Alves
{"title":"Optimal placement of capacitor banks in distorted electrical distribution network based on a constrained multi-objective immune algorithm","authors":"H. N. Alves","doi":"10.1109/CEC.2016.7744288","DOIUrl":"https://doi.org/10.1109/CEC.2016.7744288","url":null,"abstract":"This paper presents a multi-objective algorithm for optimal placement of capacitor banks in distorted electrical distribution networks. A constrained multi-objective immune algorithm is proposed. The voltage profile constraints are used to define feasible solutions in the optimization process. Investments costs, power and energy losses costs and harmonic mitigation are considered in the solution. A 104-bus test system is presented and the results are compared to the solution given by a SPEA-II and a NSGA-II approach. The results confirm the efficiency of the proposed method which makes it promising to solve complex problems of planning in distribution feeders.","PeriodicalId":6344,"journal":{"name":"2009 IEEE Congress on Evolutionary Computation","volume":"55 1","pages":"3933-3938"},"PeriodicalIF":0.0,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83766856","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Robust design optimization based on multi-objective particle swarm optimization 基于多目标粒子群优化的稳健设计优化
2009 IEEE Congress on Evolutionary Computation Pub Date : 2016-01-01 DOI: 10.1109/CEC.2016.7744421
Yan Yu, Guangming Dai, Liang Chen, Chong Zhou, L. Peng
{"title":"Robust design optimization based on multi-objective particle swarm optimization","authors":"Yan Yu, Guangming Dai, Liang Chen, Chong Zhou, L. Peng","doi":"10.1109/CEC.2016.7744421","DOIUrl":"https://doi.org/10.1109/CEC.2016.7744421","url":null,"abstract":"","PeriodicalId":6344,"journal":{"name":"2009 IEEE Congress on Evolutionary Computation","volume":"1951 1","pages":"4918-4925"},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91195314","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Intelligent scheduling in flexible job shop environments based on artificial fish swarm algorithm with estimation of distribution 基于分布估计的人工鱼群算法的柔性作业车间智能调度
2009 IEEE Congress on Evolutionary Computation Pub Date : 2016-01-01 DOI: 10.1109/CEC.2016.7744198
H. Ge, Liang Sun
{"title":"Intelligent scheduling in flexible job shop environments based on artificial fish swarm algorithm with estimation of distribution","authors":"H. Ge, Liang Sun","doi":"10.1109/CEC.2016.7744198","DOIUrl":"https://doi.org/10.1109/CEC.2016.7744198","url":null,"abstract":"","PeriodicalId":6344,"journal":{"name":"2009 IEEE Congress on Evolutionary Computation","volume":"8 1","pages":"3230-3237"},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81687500","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Maximization of a dissimilarity measure for multimodal optimization 多模态优化中不同度量的最大化
2009 IEEE Congress on Evolutionary Computation Pub Date : 2015-05-25 DOI: 10.1109/CEC.2015.7257131
F. O. França
{"title":"Maximization of a dissimilarity measure for multimodal optimization","authors":"F. O. França","doi":"10.1109/CEC.2015.7257131","DOIUrl":"https://doi.org/10.1109/CEC.2015.7257131","url":null,"abstract":"Many practical problems are described by an objective-function with the intent to optimize a single goal. This leads to the important research topic of nonlinear optimization, that seeks to create algorithms and computational methods that are capable of finding a global optimum of such functions. But, many functions are multimodal, having many different global optima. Also, given the impossibility to create an exact model of a real-world problem, not every global (or local) optima is feaseable to be conceived. As such, it is interesting to find as many alternative optima in order to find one that is feaseable given unmodelled constraints. This paper proposes a methodology that, given a local optimum, it finds nearby local optima with similar objective-function values. This is performed by maximizing the approximation error of a Linear Interpolation of the function. The experiments show promising results regarding the number of detected peaks when compared to the state-of-the-art, though requiring a higher number of function evaluations on average.","PeriodicalId":6344,"journal":{"name":"2009 IEEE Congress on Evolutionary Computation","volume":"44 1","pages":"2002-2009"},"PeriodicalIF":0.0,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74078088","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Elite Bias Genetic Algorithm for Optimal Control of Double-skin Facade 双层幕墙最优控制的精英偏差遗传算法
2009 IEEE Congress on Evolutionary Computation Pub Date : 2015-01-01 DOI: 10.1109/CEC.2015.7257310
Xingtian Xu, X. Chen
{"title":"Elite Bias Genetic Algorithm for Optimal Control of Double-skin Facade","authors":"Xingtian Xu, X. Chen","doi":"10.1109/CEC.2015.7257310","DOIUrl":"https://doi.org/10.1109/CEC.2015.7257310","url":null,"abstract":"","PeriodicalId":6344,"journal":{"name":"2009 IEEE Congress on Evolutionary Computation","volume":"8 1","pages":"3354-3361"},"PeriodicalIF":0.0,"publicationDate":"2015-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84683580","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A multi-objective evolutionary algorithm based on decomposition for constrained multi-objective optimization 一种基于分解的约束多目标优化多目标进化算法
2009 IEEE Congress on Evolutionary Computation Pub Date : 2014-07-06 DOI: 10.1109/CEC.2014.6900645
Saúl Zapotecas Martínez, C. Coello
{"title":"A multi-objective evolutionary algorithm based on decomposition for constrained multi-objective optimization","authors":"Saúl Zapotecas Martínez, C. Coello","doi":"10.1109/CEC.2014.6900645","DOIUrl":"https://doi.org/10.1109/CEC.2014.6900645","url":null,"abstract":"In spite of the popularity of the Multi-objective Evolutionary Algorithm based on Decomposition (MOEA/D), its use in Constrained Multi-objective Optimization Problems (CMOPs) has not been fully explored. In the last few years, there have been a few proposals to extend MOEA/D to the solution of CMOPs. However, most of these proposals have adopted selection mechanisms based on penalty functions. In this paper, we present a novel selection mechanism based on the well-known e-constraint method. The proposed approach uses information related to the neighborhood adopted in MOEA/D in order to obtain solutions which minimize the objective functions within the allowed feasible region. Our preliminary results indicate that our approach is highly competitive with respect to a state-of-the-art MOEA which solves in an efficient way the constrained test problems adopted in our comparative study.","PeriodicalId":6344,"journal":{"name":"2009 IEEE Congress on Evolutionary Computation","volume":"55 1","pages":"429-436"},"PeriodicalIF":0.0,"publicationDate":"2014-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85047754","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 40
AIRP: A heuristic algorithm for solving the unrelated parallel machine scheduling problem 求解不相关并行机调度问题的启发式算法
2009 IEEE Congress on Evolutionary Computation Pub Date : 2014-07-06 DOI: 10.1109/CEC.2014.6900245
L. P. Cota, Matheus Nohra Haddad, M. Souza, V. N. Coelho
{"title":"AIRP: A heuristic algorithm for solving the unrelated parallel machine scheduling problem","authors":"L. P. Cota, Matheus Nohra Haddad, M. Souza, V. N. Coelho","doi":"10.1109/CEC.2014.6900245","DOIUrl":"https://doi.org/10.1109/CEC.2014.6900245","url":null,"abstract":"This paper deals with the Unrelated Parallel Machine Scheduling Problem with Setup Times (UPMSPST). The objective is to minimize the makespan. In order to solve it, we propose a heuristic algorithm, based on Iterated Local Search (ILS), Variable Neighborhood Descent (VND) and Path Relinking (PR). In this algorithm, named AIRP, an initial solution is constructed using the Adaptive Shortest Processing Time method. This solution is refined by the ILS, having an adaptation of the VND as local search method. The PR method is applied as a strategy of intensification and diversification during the search. The algorithm was tested in instances of the literature envolving up to 150 jobs and 20 machines. The computational experiments show that the proposed algorithm outperforms an algorithm from the literature, both in terms of quality and variability of the final solution. In addition, the algorithm established new best solutions for more than 80,5% of the test problems in average.","PeriodicalId":6344,"journal":{"name":"2009 IEEE Congress on Evolutionary Computation","volume":"3 1","pages":"1855-1862"},"PeriodicalIF":0.0,"publicationDate":"2014-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74353341","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 19
Deep Boltzmann Machine for evolutionary agents of Mario AI 马里奥AI进化代理的深度玻尔兹曼机
2009 IEEE Congress on Evolutionary Computation Pub Date : 2014-01-01 DOI: 10.1109/CEC.2014.6900625
H. Handa
{"title":"Deep Boltzmann Machine for evolutionary agents of Mario AI","authors":"H. Handa","doi":"10.1109/CEC.2014.6900625","DOIUrl":"https://doi.org/10.1109/CEC.2014.6900625","url":null,"abstract":"","PeriodicalId":6344,"journal":{"name":"2009 IEEE Congress on Evolutionary Computation","volume":"56 1","pages":"36-41"},"PeriodicalIF":0.0,"publicationDate":"2014-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86560896","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Chaotic Particle Swarm Optimization algorithm for the jobshop scheduling problem 作业车间调度问题的混沌粒子群优化算法
2009 IEEE Congress on Evolutionary Computation Pub Date : 2014-01-01 DOI: 10.1109/CEC.2014.6900276
Ping Yan, Ming-hai Jiao
{"title":"A Chaotic Particle Swarm Optimization algorithm for the jobshop scheduling problem","authors":"Ping Yan, Ming-hai Jiao","doi":"10.1109/CEC.2014.6900276","DOIUrl":"https://doi.org/10.1109/CEC.2014.6900276","url":null,"abstract":"","PeriodicalId":6344,"journal":{"name":"2009 IEEE Congress on Evolutionary Computation","volume":"52 1","pages":"218-222"},"PeriodicalIF":0.0,"publicationDate":"2014-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76344818","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Intellectual evolution method for synthesis of mobile robot control system 移动机器人控制系统综合的智能进化方法
2009 IEEE Congress on Evolutionary Computation Pub Date : 2013-01-01 DOI: 10.1109/CEC.2013.6557549
A. Diveev, D. Khamadiyarov, E. Shmalko, E. Sofronova
{"title":"Intellectual evolution method for synthesis of mobile robot control system","authors":"A. Diveev, D. Khamadiyarov, E. Shmalko, E. Sofronova","doi":"10.1109/CEC.2013.6557549","DOIUrl":"https://doi.org/10.1109/CEC.2013.6557549","url":null,"abstract":"","PeriodicalId":6344,"journal":{"name":"2009 IEEE Congress on Evolutionary Computation","volume":"74 1","pages":"24-31"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84801885","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信