2013 IEEE Congress on Evolutionary Computation最新文献_第9页

R2-IBEA: R2 indicator based evolutionary algorithm for multiobjective optimization R2- ibea:基于R2指标的多目标优化进化算法

2013 IEEE Congress on Evolutionary Computation Pub Date : 2013-06-20 DOI: 10.1109/CEC.2013.6557783

Dung H. Phan, J. Suzuki

引用次数: 120

PSO-gain selection to improve a discrete-time second order sliding mode controller pso增益选择改进离散二阶滑模控制器

2013 IEEE Congress on Evolutionary Computation Pub Date : 2013-06-20 DOI: 10.1109/CEC.2013.6557672

A. Alanis, N. Arana-Daniel, C. López-Franco, E. Sánchez

引用次数: 4

Hybrid feature selection and peptide binding affinity prediction using an EDA based algorithm 基于EDA算法的混合特征选择和肽结合亲和力预测

2013 IEEE Congress on Evolutionary Computation Pub Date : 2013-06-20 DOI: 10.1109/CEC.2013.6557854

Kalpesh Shelke, S. Jayaraman, Shameek Ghosh, V. Jayaraman

{"title":"Hybrid feature selection and peptide binding affinity prediction using an EDA based algorithm","authors":"Kalpesh Shelke, S. Jayaraman, Shameek Ghosh, V. Jayaraman","doi":"10.1109/CEC.2013.6557854","DOIUrl":"https://doi.org/10.1109/CEC.2013.6557854","url":null,"abstract":"Protein function prediction is an important problem in functional genomics. Typically, protein sequences are represented by feature vectors. A major problem of protein datasets that increase the complexity of classification models is their large number of features. The process of drug discovery often involves the use of quantitative structure-activity relationship (QSAR) models to identify chemical structures that could have good inhibitory effects on specific targets and have low toxicity (non-specific activity). QSAR models are regression or classification models used in the chemical and biological sciences. Because of high dimensionality problems, a feature selection problem is imminent. In this study, we thus employ a hybrid Estimation of Distribution Algorithm (EDA) based filter-wrapper methodology to simultaneously extract informative feature subsets and build robust QSAR models. The performance of the algorithm was tested on the benchmark classification challenge datasets obtained from the CoePRa competition platform, developed in 2006. Our results clearly demonstrate the efficacy of a hybrid EDA filter-wrapper algorithm in comparison to the results reported earlier.","PeriodicalId":211988,"journal":{"name":"2013 IEEE Congress on Evolutionary Computation","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122403275","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

Multi-port multi-terminal analog router based on an evolutionary optimization kernel 基于进化优化内核的多端口多终端模拟路由器

2013 IEEE Congress on Evolutionary Computation Pub Date : 2013-06-20 DOI: 10.1109/CEC.2013.6557907

R. Martins, N. Lourenço, A. Canelas, N. Horta

{"title":"Multi-port multi-terminal analog router based on an evolutionary optimization kernel","authors":"R. Martins, N. Lourenço, A. Canelas, N. Horta","doi":"10.1109/CEC.2013.6557907","DOIUrl":"https://doi.org/10.1109/CEC.2013.6557907","url":null,"abstract":"In the state-of-the-art on analog integrated circuit (IC) automatic routing approaches it is assumed that each terminal has only one port that can be routed, however, in practice a device usually contains multiple electrically-equivalent locations where the connection can be made, multi-port terminals, which are not properly explored. This paper describes an innovative evolutionary approach with multi-port multiterminal (MP/MT) nets for analog IC automatic routing. The netlist and the multi-port terminals are modeled in a Group-Steiner problem that is solved by the Global Router, to obtain the terminal-to-terminal connectivity, and then, for the detailed routing, an optimization kernel is used, namely, an enhanced version of the multi-objective evolutionary algorithm NSGA-II. The Router starts by a single-net procedure, and culminates in a process where all nets are optimized simultaneously. The technology design rules are verified during the evolutionary generation using an in-loop built-in layout evaluation procedure. The automatic routing generation is detailed, and demonstrated for the generation of the layout of a typical analog circuit, for the UMC 130nm design process. The automatically generated layouts are validated using the industrial grade Calibre® tool and the performances of the extracted circuits are compared with the ones achieved in the circuit-level design.","PeriodicalId":211988,"journal":{"name":"2013 IEEE Congress on Evolutionary Computation","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122497471","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

The Continuous Differential Ant-Stigmergy Algorithm applied on real-parameter single objective optimization problems 连续微分反stigmergy算法在实参数单目标优化问题中的应用

2013 IEEE Congress on Evolutionary Computation Pub Date : 2013-06-20 DOI: 10.1109/CEC.2013.6557760

P. Korošec, J. Silc

引用次数: 16

A comparison of evolutionary algorithms on a set of antenna design benchmarks 一组天线设计基准上进化算法的比较

2013 IEEE Congress on Evolutionary Computation Pub Date : 2013-06-20 DOI: 10.1109/CEC.2013.6557623

Aniruddha Basak, J. Lohn

{"title":"A comparison of evolutionary algorithms on a set of antenna design benchmarks","authors":"Aniruddha Basak, J. Lohn","doi":"10.1109/CEC.2013.6557623","DOIUrl":"https://doi.org/10.1109/CEC.2013.6557623","url":null,"abstract":"Many antenna design and optimization problems require optimizing multimodal, high dimensional, non-convex and inseparable objective functions. This has led researchers towards stochastic optimization techniques such as evolutionary algorithms (EAs) instead of classical gradient-based methods for these applications. However, despite many past successes, very little is known about which types of EAs map best to which types of antenna optimization problems. The goal of this work is to investigate this mapping of EAs to applications by comparing the performance of three EAs on five benchmark antenna design problems and one real-world problem derived from a NASA satellite mission. Performance of these algorithms has been compared on the basis of success rates and average convergence time over 30 independent runs. Our results indicate that age-layered population structure genetic algorithm (ALPS-GA) performed best in terms of success rates and convergence speed. However, on the NASA antenna design problem differential evolution achieved highest success rates, which was marginally better than ALPSGA. We also explored the effect of increasing antenna complexity on the antenna gain.","PeriodicalId":211988,"journal":{"name":"2013 IEEE Congress on Evolutionary Computation","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131553714","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

A self-adaptive heterogeneous pso for real-parameter optimization 面向实参数优化的自适应异构粒子群算法

2013 IEEE Congress on Evolutionary Computation Pub Date : 2013-06-20 DOI: 10.1109/CEC.2013.6557592

Filipe V. Nepomuceno, A. Engelbrecht

引用次数: 82

Optimization of an energy harvesting buoy for coral reef monitoring 用于珊瑚礁监测的能量收集浮标的优化设计

2013 IEEE Congress on Evolutionary Computation Pub Date : 2013-06-20 DOI: 10.1109/CEC.2013.6557627

A. Pirisi, F. Grimaccia, M. Mussetta, R. Zich, R. Johnstone, M. Palaniswami, S. Rajasegarar

引用次数: 13

A hybrid local search operator for multiobjective optimization 多目标优化的混合局部搜索算子

2013 IEEE Congress on Evolutionary Computation Pub Date : 2013-06-20 DOI: 10.1109/CEC.2013.6557568

Alan Díaz-Manríquez, G. T. Pulido, R. Becerra

{"title":"A hybrid local search operator for multiobjective optimization","authors":"Alan Díaz-Manríquez, G. T. Pulido, R. Becerra","doi":"10.1109/CEC.2013.6557568","DOIUrl":"https://doi.org/10.1109/CEC.2013.6557568","url":null,"abstract":"In recent years, the development of hybrid approaches to solve multiobjective optimization problems has become an important trend in the evolutionary computation community. Despite hybrid approaches of mathematical programming techniques with multiobjective evolutionary algorithms are not very popular, when both fields are successfully coupled, results are impressive. However, the main objective of this sort of hybridization relays on the needing of several executions of the mathematical approach in order to obtain a sample of the Pareto front, raising with this, the number of fitness function evaluations. However, the use of surrogate models has become a recurrent approach to diminish the number of function evaluations. In this work, a hybrid operator that transforms the original multiobjective problem into a set of modified goal programming models is proposed. Furthermore, a local surrogate model is used instead of the real function in the hybrid operator. The goal programming model with the surrogate is optimized by a direct search method. Additionally, a standalone algorithm that uses the hybrid operator is here proposed. The new algorithm is validated using several test problems and performance measures commonly adopted in the specialized literature. Results indicate that the proposed operator gives rise to an effective algorithm, which produces results that are competitive with respect to those obtained by two well-known multiobjective evolutionary algorithms.","PeriodicalId":211988,"journal":{"name":"2013 IEEE Congress on Evolutionary Computation","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127769412","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

CMA-ES with restarts for solving CEC 2013 benchmark problems CMA-ES与重启解决CEC 2013基准问题

2013 IEEE Congress on Evolutionary Computation Pub Date : 2013-06-20 DOI: 10.1109/CEC.2013.6557593

I. Loshchilov

引用次数: 133