2017 IEEE Congress on Evolutionary Computation (CEC)最新文献

筛选
英文 中文
Enhanced firefly algorithm for constrained numerical optimization 约束数值优化的改进萤火虫算法
2017 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2017-06-05 DOI: 10.1109/CEC.2017.7969561
I. Strumberger, N. Bačanin, M. Tuba
{"title":"Enhanced firefly algorithm for constrained numerical optimization","authors":"I. Strumberger, N. Bačanin, M. Tuba","doi":"10.1109/CEC.2017.7969561","DOIUrl":"https://doi.org/10.1109/CEC.2017.7969561","url":null,"abstract":"Firefly algorithm is one of the recent and very promising swarm intelligence metaheuristics for tackling hard optimization problems. While firefly algorithm has been proven on various numerical and engineering optimization problems as a robust metaheuristic, it was not properly tested on a wide set of constrained benchmark functions. We performed testing of the original firefly algorithm on a set of standard 13 benchmark functions for constrained problems and it exhibited certain deficiencies, primarily insufficient exploration during early stage of the search. In this paper we propose enhanced firefly algorithm where main improvements are correlated to the hybridization with the exploration mechanism from another swarm intelligence algorithm, introduction of new exploitation mechanism and parameter-based tuning of the exploration-exploitation balance. We tested our approach on the same standard benchmark functions and showed that it not only overcame weaknesses of the original firefly algorithm, but also outperformed other state-of-the-art swarm intelligence algorithms.","PeriodicalId":335123,"journal":{"name":"2017 IEEE Congress on Evolutionary Computation (CEC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125345639","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
Particle filter track-before-detect algorithm with Lamarckian inheritance for improved dim target tracking 基于lamarkian遗传的粒子滤波检测前跟踪算法改进了弱小目标跟踪
2017 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2017-06-05 DOI: 10.1109/CEC.2017.7969437
Lin Li, Yun Li
{"title":"Particle filter track-before-detect algorithm with Lamarckian inheritance for improved dim target tracking","authors":"Lin Li, Yun Li","doi":"10.1109/CEC.2017.7969437","DOIUrl":"https://doi.org/10.1109/CEC.2017.7969437","url":null,"abstract":"Particle filter track-before-detect (PF-TBD) algorithms offer improvements over track-after-detect algorithms in detecting and tracking dim targets. However, it suffers from the particle collapsing problem, which can lead to deteriorated detection and tracking performance. To address this issue, a Lamarckian particle filter track-before-detect (LPF-TBD) algorithm is developed in this paper. In the LPF-TBD, before a TBD resampling process, a particle update strategy is applied, which is based on Lamarckian overriding and elitist operators designed to improve the particle diversity and efficiency. The effectiveness of the LPF-TBD algorithm is demonstrated using a widely adopted experiment on a target with a low signal-to-noise ratio in an image sequence. Compared with the currently-popular multinomial resampling PF-TBD method, the posterior distribution in the LPF-TBD can be more sufficiently approximated by the particles. Test results show that the LPF-TBD offers higher detection and tracking performance, while strengthening the algorithmic efficiency of particle filtering and evolutionary algorithms.","PeriodicalId":335123,"journal":{"name":"2017 IEEE Congress on Evolutionary Computation (CEC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122945397","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}
引用次数: 4
A first attempt on global evolutionary undersampling for imbalanced big data 对不平衡大数据的全球进化欠采样的首次尝试
2017 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2017-06-05 DOI: 10.1109/CEC.2017.7969553
I. Triguero, M. Galar, H. Bustince, F. Herrera
{"title":"A first attempt on global evolutionary undersampling for imbalanced big data","authors":"I. Triguero, M. Galar, H. Bustince, F. Herrera","doi":"10.1109/CEC.2017.7969553","DOIUrl":"https://doi.org/10.1109/CEC.2017.7969553","url":null,"abstract":"The design of efficient big data learning models has become a common need in a great number of applications. The massive amounts of available data may hinder the use of traditional data mining techniques, especially when evolutionary algorithms are involved as a key step. Existing solutions typically follow a divide-and-conquer approach in which the data is split into several chunks that are addressed individually. Next, the partial knowledge acquired from every slice of data is aggregated in multiple ways to solve the entire problem. However, these approaches are missing a global view of the data as a whole, which may result in less accurate models. In this work we carry out a first attempt on the design of a global evolutionary undersampling model for imbalanced classification problems. These are characterised by having a highly skewed distribution of classes in which evolutionary models are being used to balance the dataset by selecting only the most relevant data. Using Apache Spark as big data technology, we have introduced a number of variations to the well-known CHC algorithm to work with very large chromosomes and reduce the costs associated to the fitness evaluation. We discuss some preliminary results, showing the great potential of this new kind of evolutionary big data model.","PeriodicalId":335123,"journal":{"name":"2017 IEEE Congress on Evolutionary Computation (CEC)","volume":"676 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121996429","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}
引用次数: 15
Genetic programming for improved cryptanalysis of elliptic curve cryptosystems 改进椭圆曲线密码系统密码分析的遗传规划
2017 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2017-06-05 DOI: 10.1109/CEC.2017.7969342
Tim Ribaric, S. Houghten
{"title":"Genetic programming for improved cryptanalysis of elliptic curve cryptosystems","authors":"Tim Ribaric, S. Houghten","doi":"10.1109/CEC.2017.7969342","DOIUrl":"https://doi.org/10.1109/CEC.2017.7969342","url":null,"abstract":"Public-key cryptography is a fundamental component of modern electronic communication that can be constructed with many different mathematical processes. Presently, cryptosystems based on elliptic curves are becoming popular due to strong cryptographic strength per small key size. At the heart of these schemes is the intractability of the elliptic curve discrete logarithm problem (ECDLP). Pollard's Rho algorithm is a well known method for solving the ECDLP and thereby breaking ciphers based on elliptic curves. It has the same time complexity as other known methods but is advantageous due to smaller memory requirements. This paper considers how to speed up the Rho process by modifying a key component: the iterating function, which is the part of the algorithm responsible for determining what point is considered next when looking for a collision. It is replaced with an alternative that is found through an evolutionary process. This alternative consistently and significantly decreases the number of iterations required by Pollard's Rho Algorithm to successfully find a solution to the ECDLP.","PeriodicalId":335123,"journal":{"name":"2017 IEEE Congress on Evolutionary Computation (CEC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116626577","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}
引用次数: 5
LSHADE with semi-parameter adaptation hybrid with CMA-ES for solving CEC 2017 benchmark problems 半参数自适应LSHADE与CMA-ES混合求解CEC 2017基准问题
2017 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2017-06-05 DOI: 10.1109/CEC.2017.7969307
A. W. Mohamed, Anas A. Hadi, A. Fattouh, K. Jambi
{"title":"LSHADE with semi-parameter adaptation hybrid with CMA-ES for solving CEC 2017 benchmark problems","authors":"A. W. Mohamed, Anas A. Hadi, A. Fattouh, K. Jambi","doi":"10.1109/CEC.2017.7969307","DOIUrl":"https://doi.org/10.1109/CEC.2017.7969307","url":null,"abstract":"To improve the optimization performance of LSHADE algorithm, an alternative adaptation approach for the selection of control parameters is proposed. The proposed algorithm, named LSHADE-SPA, uses a new semi-parameter adaptation approach to effectively adapt the values of the scaling factor of the Differential evolution algorithm. The proposed approach consists of two different settings for two control parameters F and Cr. The benefit of this approach is to prove that the semi-adaptive algorithm is better than pure random algorithm or fully adaptive or self-adaptive algorithm. To enhance the performance of our algorithm, we also introduced a hybridization framework named LSHADE-SPACMA between LSHADE-SPA and a modified version of CMA-ES. The modified version of CMA-ES undergoes the crossover operation to improve the exploration capability of the proposed framework. In LSHADE-SPACMA both algorithms will work simultaneously on the same population, but more populations will be assigned gradually to the better performance algorithm. In order to verify and analyze the performance of both LSHADE-SPA and LSHADE-SPACMA, Numerical experiments on a set of 30 test problems from the CEC2017 benchmark for 10, 30, 50 and 100 dimensions, including a comparison with LSHADE algorithm are executed. Experimental results indicate that in terms of robustness, stability, and quality of the solution obtained, of both LSHADE-SPA and LSHADE-SPACMA are better than LSHADE algorithm, especially as the dimension increases.","PeriodicalId":335123,"journal":{"name":"2017 IEEE Congress on Evolutionary Computation (CEC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130549889","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}
引用次数: 223
An evolutionary trust game for the sharing economy 共享经济的进化信任游戏
2017 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2017-06-05 DOI: 10.1109/CEC.2017.7969610
M. Chica, R. Chiong, M. Adam, S. Damas, Timm Teubner
{"title":"An evolutionary trust game for the sharing economy","authors":"M. Chica, R. Chiong, M. Adam, S. Damas, Timm Teubner","doi":"10.1109/CEC.2017.7969610","DOIUrl":"https://doi.org/10.1109/CEC.2017.7969610","url":null,"abstract":"In this paper, we present an evolutionary trust game to investigate the formation of trust in the so-called sharing economy from a population perspective. To the best of our knowledge, this is the first attempt to model trust in the sharing economy using the evolutionary game theory framework. Our sharing economy trust model consists of four types of players: a trustworthy provider, an untrustworthy provider, a trustworthy consumer, and an untrustworthy consumer. Through systematic simulation experiments, five different scenarios with varying proportions and types of providers and consumers were considered. Our results show that each type of players influences the existence and survival of other types of players, and untrustworthy players do not necessarily dominate the population even when the temptation to defect (i.e., to be untrustworthy) is high. Our findings may have important implications for understanding the emergence of trust in the context of sharing economy transactions.","PeriodicalId":335123,"journal":{"name":"2017 IEEE Congress on Evolutionary Computation (CEC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131535022","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}
引用次数: 14
A closer look to elitism in ε-dominance many-objective optimization ε-显性多目标优化中的精英主义
2017 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2017-06-05 DOI: 10.1109/CEC.2017.7969638
Ryoma Sano, H. Aguirre, Kiyoshi Tanaka
{"title":"A closer look to elitism in ε-dominance many-objective optimization","authors":"Ryoma Sano, H. Aguirre, Kiyoshi Tanaka","doi":"10.1109/CEC.2017.7969638","DOIUrl":"https://doi.org/10.1109/CEC.2017.7969638","url":null,"abstract":"Elitism is a common feature of many-objective optimizers and has a strong impact on the performance of the algorithms. The way elitism is implemented vary among the various approaches to many-objective optimization and there are no detailed studies about their effects. In this work we focus on a multi- and many-objective optimization approach based on ε-dominance. We track the number of generations a solution remains in the population to bias survival selection or the creation of neighborhoods for parent selection. We investigate how elitist strategies affect performance of the algorithm and show that convergence and diversity can be enhanced by using different strategies for elitism on many-objective uni-modal and multi-modal problems with 4, 5, and 6 objectives.","PeriodicalId":335123,"journal":{"name":"2017 IEEE Congress on Evolutionary Computation (CEC)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115776380","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
An improved multiobjective evolutionary approach for community detection in multilayer networks 一种改进的多层网络社区检测的多目标进化方法
2017 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2017-06-05 DOI: 10.1109/CEC.2017.7969345
Wenfeng Liu, Shanfeng Wang, Maoguo Gong, Mingyang Zhang
{"title":"An improved multiobjective evolutionary approach for community detection in multilayer networks","authors":"Wenfeng Liu, Shanfeng Wang, Maoguo Gong, Mingyang Zhang","doi":"10.1109/CEC.2017.7969345","DOIUrl":"https://doi.org/10.1109/CEC.2017.7969345","url":null,"abstract":"The detection of shared community structure in multilayer network is an interesting and important issue that has attracted many researches. Traditional methods for community detection of single layer networks are not suitable for that of multilayer networks. In a previous work, the authors modeled the community discovery problem in multilayer network as a multiobjective one and devised a genetic algorithm to carry out it. In this paper, based on their model, we propose an improved multiobjective evolutionary approach MOEA-MultiNet for community detection in multilayer networks. The proposed MOEA-MultiNet is based on the framework of NSGA-II which employs the string-based representation scheme and synthesizes the genetic operation and local search to perform individual refinement. Experimental results on two real-world networks both demonstrate the ability and efficiency of the proposed MOEA-MultiNet in detecting community structure in multilayer networks.","PeriodicalId":335123,"journal":{"name":"2017 IEEE Congress on Evolutionary Computation (CEC)","volume":"254 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117325500","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}
引用次数: 5
Single objective real-parameter optimization: Algorithm jSO 单目标实参数优化:jSO算法
2017 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2017-06-05 DOI: 10.1109/CEC.2017.7969456
J. Brest, M. Maučec, B. Bošković
{"title":"Single objective real-parameter optimization: Algorithm jSO","authors":"J. Brest, M. Maučec, B. Bošković","doi":"10.1109/CEC.2017.7969456","DOIUrl":"https://doi.org/10.1109/CEC.2017.7969456","url":null,"abstract":"Solving single objective real-parameter optimization problems, also known as a bound-constrained optimization, is still a challenging task. We can find such problems in engineering optimization, scientific applications, and in other real-world problems. Usually, these problems are very complex and computationally expensive. A new algorithm, called jSO, is presented in this paper. The algorithm is an improved variant of the iL-SHADE algorithm, mainly with a new weighted version of mutation strategy. The experiments were performed on CEC 2017 benchmark functions, which are different from previous competition benchmark functions. A comparison of the proposed jSO algorithm and the L-SHADE algorithm is presented first. From the obtained results we can conclude that jSO performs better in comparison with the L-SHADE algorithm. Next, a comparison of jSO and iL-SHADE is also performed, and jSO obtained better or competitive results. Using the CEC 2017 evaluation method, jSO obtained the best final score among these three algorithms.","PeriodicalId":335123,"journal":{"name":"2017 IEEE Congress on Evolutionary Computation (CEC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125362475","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}
引用次数: 286
Multi-agent systems applied to power loss minimization in distribution-level smart grid with dynamic load variation 多智能体系统在负荷动态变化的配电级智能电网中的应用
2017 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2017-06-05 DOI: 10.1109/CEC.2017.7969316
F. Saraiva, L. Nordström, E. Asada
{"title":"Multi-agent systems applied to power loss minimization in distribution-level smart grid with dynamic load variation","authors":"F. Saraiva, L. Nordström, E. Asada","doi":"10.1109/CEC.2017.7969316","DOIUrl":"https://doi.org/10.1109/CEC.2017.7969316","url":null,"abstract":"Modern distribution system are expected to provide new features such as taking advantage of Cyber-Physical Systems (CPS) - new equipment and devices embedded with sensors, network communication, and computational intelligence techniques to provide increased system performance and power quality. Among the performance improvement, the reduction of electrical losses is an important quality factor which is associated with energy efficiency. This paper presents a method based on Multi-agent Systems (MAS) that manages topology changes by switching operations to improve the system performance in dynamic scenario, where the power demand varies throughout the day. Experiments were performed allocating three different load consumer profiles (residential, commercial, and industrial) in two test systems with 12-bus and 16-bus, creating several scenarios. The agents were deployed in a set of small-sized single-board computers with low computational power to mimic CPS. The simulations has shown the success of the method on managing the decision making among different agents to provide the joint effort to manage the loss reduction on the network.","PeriodicalId":335123,"journal":{"name":"2017 IEEE Congress on Evolutionary Computation (CEC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116714208","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}
引用次数: 8
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学术官方微信