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

筛选
英文 中文
A classification and Pareto domination based multiobjective evolutionary algorithm 一种基于分类和Pareto支配的多目标进化算法
2015 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2015-09-14 DOI: 10.1109/CEC.2015.7257247
Jinyuan Zhang, Aimin Zhou, Guixu Zhang
{"title":"A classification and Pareto domination based multiobjective evolutionary algorithm","authors":"Jinyuan Zhang, Aimin Zhou, Guixu Zhang","doi":"10.1109/CEC.2015.7257247","DOIUrl":"https://doi.org/10.1109/CEC.2015.7257247","url":null,"abstract":"In multiobjective evolutionary algorithms, most selection operators are based on the objective values or the approximated objective values. It is arguable that the selection in evolutionary algorithms is a classification problem in nature, i.e., selection equals to classifying the selected solutions into one class and the unselected ones into another class. Following this idea, we propose a classification based preselection for multiobjective evolutionary algorithms. This approach maintains two external populations: one is a positive data set which contains a set of `good' solutions, and the other is a negative data set contains a set of `bad' solutions. In each generation, the two external populations are used to train a classifier firstly, then the classifier is applied to filter the newly generated candidate solutions and only the ones labeled as positive are kept as the offspring solutions. The proposed preselection is integrated into the Pareto domination based algorithm framework in this paper. A systematic empirical study on the influence of different classifiers and different reproduction operators has been done. The experimental results indicate that the classification based preselection can improve the performance of Pareto domination based multiobjective evolutionary algorithms.","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116083924","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}
引用次数: 58
A minimum population search hybrid for large scale global optimization 一种大规模全局优化的最小种群搜索混合算法
2015 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2015-09-14 DOI: 10.1109/CEC.2015.7257125
Antonio Bolufé-Röhler, Sonia Fiol-González, Stephen Y. Chen
{"title":"A minimum population search hybrid for large scale global optimization","authors":"Antonio Bolufé-Röhler, Sonia Fiol-González, Stephen Y. Chen","doi":"10.1109/CEC.2015.7257125","DOIUrl":"https://doi.org/10.1109/CEC.2015.7257125","url":null,"abstract":"Large-scale global optimization is a challenging task which is embedded in many scientific and engineering applications. Among large scale problems, multimodal functions present an exceptional challenge because of the need to promote exploration. In this paper we present a hybrid heuristic specifically designed for optimizing large scale multimodal functions. The hybrid is based on the unbiased exploration ability of Minimum Population Search. Minimum Population Search is a recently developed metaheuristic able to efficiently optimize multimodal functions. However, MPS lacks techniques for exploiting search gradients. To overcome this limitation, we combine its exploration power with the intense local search of the CMA-ES algorithm. The proposed algorithm is evaluated on the test functions provided by the LSGO competition of IEEE Congress of Evolutionary Computation (CEC 2013).","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130160316","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}
引用次数: 22
WSN's energy-aware coverage preserving optimization model based on multi-objective bat algorithm 基于多目标蝙蝠算法的WSN能量感知覆盖保持优化模型
2015 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2015-05-25 DOI: 10.1109/CEC.2015.7256927
Marwa Sharawi, E. Emary, I. Saroit, Hesham El-Mahdy
{"title":"WSN's energy-aware coverage preserving optimization model based on multi-objective bat algorithm","authors":"Marwa Sharawi, E. Emary, I. Saroit, Hesham El-Mahdy","doi":"10.1109/CEC.2015.7256927","DOIUrl":"https://doi.org/10.1109/CEC.2015.7256927","url":null,"abstract":"This research expands the scope of wireless sensor network (WSN) optimization from single objective to multi objective optimization. It introduces a WSN's energy-aware and coverage preserve hierarchal clustering and routing model based on multi-objective bat swarm optimization algorithm. Two objectives are taken into consideration; coverage and nodes residual energies. The proposed model optimizes the WSN by selecting the best fitting set of nodes as cluster heads. It works to maximize the WSN's coverage and to minimize the nodes' consumed energy. This minimizes the number of active cluster heads while preserving a higher percentage of the covered nodes in WSN. It extends the longevity of the WSN's lifetime and achieves good functioning reliability. The proposed optimization model overcomes the WSN's coverage and lifetime challenges. The proposed model outperforms the LEACH routing and clustering protocol.","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115482205","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}
引用次数: 22
Fireworks algorithm for the multi-satellite control resource scheduling problem 烟花算法用于多卫星控制资源调度问题
2015 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2015-05-25 DOI: 10.1109/CEC.2015.7257036
Zhenbao Liu, Zuren Feng, Liangjun Ke
{"title":"Fireworks algorithm for the multi-satellite control resource scheduling problem","authors":"Zhenbao Liu, Zuren Feng, Liangjun Ke","doi":"10.1109/CEC.2015.7257036","DOIUrl":"https://doi.org/10.1109/CEC.2015.7257036","url":null,"abstract":"In this study, fireworks algorithm (FWA) for the multi-satellite control resource scheduling problem (MSCRSP) is presented. FWA is a meta-heuristic method and widely used in continuous problems while MSCRSP is a constrained and large scale combinatorial problem. The key points of FWA are to define a suitable neighborhood structure for launching the local search procedure and to find a metric for quantifying the disparity between solutions. Three kinds of neighborhood structures are presented and the best fitted one is picked. Due to the speciality of this problem, each solution is transformed into a binary vector, and Hamming distance is adopted for defining disparity metric. The experimental results demonstrate the proposed FWA is more competitive than those commonly used methods.","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114645317","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}
引用次数: 28
Balanced civilization map generation based on Open Data 基于开放数据的平衡文明地图生成
2015 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2015-05-25 DOI: 10.1109/CEC.2015.7257063
Gabriella A. B. Barros, J. Togelius
{"title":"Balanced civilization map generation based on Open Data","authors":"Gabriella A. B. Barros, J. Togelius","doi":"10.1109/CEC.2015.7257063","DOIUrl":"https://doi.org/10.1109/CEC.2015.7257063","url":null,"abstract":"This work investigates how to incorporate real-world data into game content so that the content is playable and enjoyable while not misrepresenting the data. We propose a method for generating balanced Civilization maps based on Open Data, describing how to acquire, transform and integrate information from different sources into a single content. Furthermore, we evolve players' initial positions in order to obtain balanced maps, while trying to minimize information accuracy loss. In addition, this paper describes a tool to assist users in this process. Maps generated using these method and tool are playable and balanced yet faithful to the original sources.","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116629924","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 GP approach to QoS-aware web service composition including conditional constraints 一种GP方法,用于支持qos的web服务组合,包括条件约束
2015 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2015-05-25 DOI: 10.1109/CEC.2015.7257145
Alexandre Sawczuk da Silva, Hui Ma, Mengjie Zhang
{"title":"A GP approach to QoS-aware web service composition including conditional constraints","authors":"Alexandre Sawczuk da Silva, Hui Ma, Mengjie Zhang","doi":"10.1109/CEC.2015.7257145","DOIUrl":"https://doi.org/10.1109/CEC.2015.7257145","url":null,"abstract":"Automated Web service composition is one of the holy grails of service-oriented computing, since it allows users to create an application simply by specifying the inputs the resulting application should require, the outputs it should produce, and any constraints it should respect. The composition problem has been handled using a variety of techniques, from AI planning to optimisation algorithms, however no approach so far has focused on handling three composition dimensions simultaneously, producing solutions that are: (1) fully functional (i.e. fully executable), (2) respect conditional constraints (e.g. user can specify logical branching), and (3) are optimised according to nonfunctional Quality of Service (QoS) measurements. This paper presents a genetic programming approach that addresses these three dimensions simultaneously through the fitness function, as well as through the enforcement of constraints to candidate trees during initialisation, mutation, and crossover. The approach is tested using an extended version of the WSC2008 datasets, and results show that fully functional and quality-optimised solutions can be created for all associated tasks, with an execution time that is roughly equivalent to that of a non-conditional approach.","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116661234","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}
引用次数: 12
Nash reweighting of Monte Carlo simulations: Tsumego 蒙特卡罗模拟的纳什重加权:Tsumego
2015 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2015-05-25 DOI: 10.1109/CEC.2015.7257060
D. St-Pierre, Jialin Liu, O. Teytaud
{"title":"Nash reweighting of Monte Carlo simulations: Tsumego","authors":"D. St-Pierre, Jialin Liu, O. Teytaud","doi":"10.1109/CEC.2015.7257060","DOIUrl":"https://doi.org/10.1109/CEC.2015.7257060","url":null,"abstract":"Monte Carlo simulations are widely accepted as a tool for evaluating positions in games. It can be used inside tree search algorithms, simple Monte Carlo search, Nested Monte Carlo and the famous Monte Carlo Tree Search algorithm which is at the heart of the current revolution in computer games. If one has access to a perfect simulation policy, then there is no need for an estimation of the game value. In any other cases, an evaluation through Monte Carlo simulations is a possible approach. However, games simulations are, in practice, biased. Many papers are devoted to improve Monte Carlo simulation policies by reducing this bias. In this paper, we propose a complementary tool: instead of modifying the simulations, we modify the way they are averaged by adjusting weights. We apply our method to MCTS for Tsumego solving. In particular, we improve Gnugo-MCTS without any online computational overhead.","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116968579","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}
引用次数: 2
A ranking method based on two preference criteria: Chebyshev function and ε-indicator 基于Chebyshev函数和ε-指标两个偏好标准的排序方法
2015 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2015-05-25 DOI: 10.1109/CEC.2015.7257240
Antonio López Jaimes, A. Oyama, K. Fujii
{"title":"A ranking method based on two preference criteria: Chebyshev function and ε-indicator","authors":"Antonio López Jaimes, A. Oyama, K. Fujii","doi":"10.1109/CEC.2015.7257240","DOIUrl":"https://doi.org/10.1109/CEC.2015.7257240","url":null,"abstract":"Previously a preference relation based on the Chebyshev achievement function to solve many-objective optimization problems was proposed. Although using this preference relation improved the performance of NSGA-II, in this paper we present a new ranking method based on the ∈-indicator and the Chebyshev achievement function. The goal of this new method is two fold: i) to improve the performance of the original algorithm, and ii) to design a parallel sorting method in order to use it with large populations (≫ 104 individuals). To do so, unlike the original approach, we have completely replaced the nondominated sorting by a method that ranks the population based on these two preference criteria. As the experiments show, the resulting algorithm outperforms both the standard NSGA-II and our previous approach in selected DTLZ problems. We also present a parallel implementation of the new sorting method. The running time analysis shows that the communication overhead is low enough to allow the speedup reach its peak for a large number of processors.","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121069077","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}
引用次数: 9
Parallel particle swarm optimization for reactive power and voltage control verifying dependability 并联粒子群优化无功电压控制可靠性验证
2015 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2015-05-25 DOI: 10.1109/CEC.2015.7256906
Y. Fukuyama
{"title":"Parallel particle swarm optimization for reactive power and voltage control verifying dependability","authors":"Y. Fukuyama","doi":"10.1109/CEC.2015.7256906","DOIUrl":"https://doi.org/10.1109/CEC.2015.7256906","url":null,"abstract":"This paper presents a parallel particle swarm optimization (PSO) for reactive power and voltage control (Volt/Var Control: VVC) in electric power systems verifying dependability of the control. Considering high penetration of renewable energies and deregulation of power systems, electric power flows can change suddenly and operators in control centers have to control voltage in wider power systems. Therefore, VVC is required to shorten the control interval and handle larger-scale power systems. One of the solutions for this problem is applications of parallel and distributed computing. Since electric power systems is one of the infrastructures of social community, sustainable voltage control is crucial and dependability is strongly required for VVC. This paper investigates not only fast computation by parallel computation but also dependability of parallel PSO for VVC. The results are meaningful for practical parallel computation by PSO in actual VVC operations.","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121122749","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}
引用次数: 6
Artificial Immune Systems in intelligent agents test 人工免疫系统在智能体中的测试
2015 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2015-05-25 DOI: 10.1109/CEC.2015.7256936
Sávio Mota Carneiro, Thiago Allison Ribeiro da Silva, R. Rabêlo, F. R. V. Silveira, G. Campos
{"title":"Artificial Immune Systems in intelligent agents test","authors":"Sávio Mota Carneiro, Thiago Allison Ribeiro da Silva, R. Rabêlo, F. R. V. Silveira, G. Campos","doi":"10.1109/CEC.2015.7256936","DOIUrl":"https://doi.org/10.1109/CEC.2015.7256936","url":null,"abstract":"Intelligent agents consist in a promising computing technology for the development of complex distributed systems. Despite the available theoretical references for guiding the designer of these agents, there are few proposed testing techniques to validate these systems. It's known that this validation depends on all the selected test cases, which should provide information regarding the components in the structure of the agent that show unsatisfactory performance. This article presents the application of Artificial Immune Systems (AIS), through Clonal Selection Algorithm (CLONALG), for the problem of optimization of selection of test cases for testing computing systems that are based on intelligent agents. In order to validate the use of CLONALG, comparisons between the Genetic Algorithms (GA) and Ant Colony Optimization Algorithms (ACO) techniques were performed. In the experiments with the approach testing intelligent agents with different types of architecture in partially and completely observable environments, the approach selected a group of satisfactory test cases in terms of the generated information about the irregular performance of the agent. From this result, the approach enables the identification of problematic episodes, allowing the designer to make objective changes in the internal structure of the agent in such a way to improve its performance.","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127098991","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}
引用次数: 2
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学术官方微信