2009 IEEE Congress on Evolutionary Computation最新文献_第8页

Differential evolution algorithm on the GPU with C-CUDA 基于C-CUDA的GPU差分进化算法

2009 IEEE Congress on Evolutionary Computation Pub Date : 2010-07-18 DOI: 10.1109/CEC.2010.5586219

L. Veronese, R. Krohling

引用次数: 98

Polynomial modeling for manufacturing processes using a backward elimination based genetic programming 基于反向消去的遗传规划制造过程的多项式建模

2009 IEEE Congress on Evolutionary Computation Pub Date : 2010-07-18 DOI: 10.1109/CEC.2010.5586309

Kit Yan Chan, T. Dillon, Che Kit Kwong

引用次数: 0

A discrete artificial bee colony algorithm for the permutation flow shop scheduling problem with total flowtime criterion 用离散人工蜂群算法求解具有总流时间准则的置换流水车间调度问题

2009 IEEE Congress on Evolutionary Computation Pub Date : 2010-07-18 DOI: 10.1109/CEC.2010.5586300

M. Tasgetiren, Q. Pan, P. N. Suganthan, A. Chen

{"title":"A discrete artificial bee colony algorithm for the permutation flow shop scheduling problem with total flowtime criterion","authors":"M. Tasgetiren, Q. Pan, P. N. Suganthan, A. Chen","doi":"10.1109/CEC.2010.5586300","DOIUrl":"https://doi.org/10.1109/CEC.2010.5586300","url":null,"abstract":"Very recently, Jarboui et al. [1] (Computers & Operations Research 36 (2009) 2638–2646) and Tseng and Lin [2] (European Journal of Operational Research 198 (2009) 84–92) presented a novel estimation distribution algorithm (EDA) and a hybrid genetic local search (hGLS) algorithm for the permutation flowshop scheduling (PFSP) with the total flowtime (TFT) criterion, respectively. Both algorithms generated excellent results, thus improving all the best known solutions reported in the literature so far. However, in this paper, we present a discrete artificial bee colony (DABC) algorithm hybridized with an iterated greedy (IG) and iterated local search (ILS) algorithms embedded in a variable neighborhood search (VNS) procedure based on swap and insertion neighborhood structures. We also present a hybrid version of our previous discrete differential evolution (hDDE) algorithm employing the IG and VNS structure too. The performance of the DABC and hDDE is highly competitive to the EDA and hGLS algorithms in terms of both solution quality and CPU times. Ultimately, 43 out of 60 best known solutions provided very recently by the EDA and hGLS algorithms are further improved by the DABC and hDDE algorithms with short-term search.","PeriodicalId":6344,"journal":{"name":"2009 IEEE Congress on Evolutionary Computation","volume":"647 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2010-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76266062","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}

引用次数: 29

Evolutionary computation based nonlinear transformations to low dimensional spaces for sensor data fusion and Visual Data Mining 基于进化计算的低维空间非线性变换传感器数据融合与可视化数据挖掘

2009 IEEE Congress on Evolutionary Computation Pub Date : 2010-07-18 DOI: 10.1109/CEC.2010.5585951

J. J. Valdés

{"title":"Evolutionary computation based nonlinear transformations to low dimensional spaces for sensor data fusion and Visual Data Mining","authors":"J. J. Valdés","doi":"10.1109/CEC.2010.5585951","DOIUrl":"https://doi.org/10.1109/CEC.2010.5585951","url":null,"abstract":"Data fusion approaches are nowadays needed and also a challenge in many areas, like sensor systems monitoring complex processes. This paper explores evolutionary computation approaches to sensor fusion based on unsupervised nonlinear transformations between the original sensor space (possibly highly-dimensional) and lower dimensional spaces. Domain-independent implicit and explicit transformations for Visual Data Mining using Differential Evolution and Genetic Programming aiming at preserving the similarity structure of the observed multivariate data are applied and compared with classical deterministic methods. These approaches are illustrated with a real world complex problem: Failure conditions in Auxiliary Power Units in aircrafts. The results indicate that the evolutionary approaches used were useful and effective at reducing dimensionality while preserving the similarity structure of the original data. Moreover the explicit models obtained with Genetic Programming simultaneously covered both feature selection and generation. The evolutionary techniques used compared very well with their classical counterparts, having additional advantages. The transformed spaces also help in visualizing and understanding the properties of the sensor data.","PeriodicalId":6344,"journal":{"name":"2009 IEEE Congress on Evolutionary Computation","volume":"12 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2010-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78327869","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

Delta-V genetic optimisation of a trajectory from Earth to Saturn with fly-by in Mars Delta-V从地球到土星的轨迹遗传优化，飞越火星

2009 IEEE Congress on Evolutionary Computation Pub Date : 2010-07-18 DOI: 10.1109/CEC.2010.5586143

F. A. Zotes, M. Peñas

引用次数: 5

Unbiased geometry optimisation of Morse atomic clusters 莫尔斯原子团簇的无偏几何优化

2009 IEEE Congress on Evolutionary Computation Pub Date : 2010-07-18 DOI: 10.1109/CEC.2010.5586213

W. Pullan

引用次数: 4

Simulated Annealing for constructing binary covering arrays of variable strength 构造变强度二元覆盖阵列的模拟退火

2009 IEEE Congress on Evolutionary Computation Pub Date : 2010-07-18 DOI: 10.1109/CEC.2010.5586148

J. Torres-Jiménez, E. Rodriguez-Tello

引用次数: 22

Evolutionary synthesis of lossless compression algorithms with GP-zip3 基于GP-zip3的无损压缩算法的进化综合

2009 IEEE Congress on Evolutionary Computation Pub Date : 2010-07-18 DOI: 10.1109/CEC.2010.5585956

A. Kattan, R. Poli

{"title":"Evolutionary synthesis of lossless compression algorithms with GP-zip3","authors":"A. Kattan, R. Poli","doi":"10.1109/CEC.2010.5585956","DOIUrl":"https://doi.org/10.1109/CEC.2010.5585956","url":null,"abstract":"Here we propose GP-zip3, a system which uses Genetic Programming to find optimal ways to combine standard compression algorithms for the purpose of compressing files and archives. GP-zip3 evolves programs with multiple components. One component analyses statistical features extracted from the raw data to be compressed (seen as a sequence of 8-bit integers) to divide the data into blocks. These blocks are then projected onto a two-dimensional Euclidean space via two further (evolved) program components. K-means clustering is applied to group similar data blocks. Each cluster is then labelled with the optimal compression algorithm for its member blocks. Once a program that achieves good compression is evolved, it can be used on unseen data without the requirement for any further evolution. GP-zip3 is similar to its predecessor, GP-zip2. Both systems outperform a variety of standard compression algorithms and are faster than other evolutionary compression techniques. However, GP-zip2 was still substantially slower than off-the-shelf algorithms. GP-zip3 alleviates this problem by using a novel fitness evaluation strategy. More specifically, GP-zip3 evolves and then uses decision trees to predict the performance of GP individuals without requiring them to be used to compress the training data. As shown in a variety of experiments, this speeds up evolution in GP-zip3 considerably over GP-zip2 while achieving similar compression results, thereby significantly broadening the scope of application of the approach.","PeriodicalId":6344,"journal":{"name":"2009 IEEE Congress on Evolutionary Computation","volume":"17 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2010-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72863108","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

A note on the first hitting time of (1 + λ) evolutionary algorithm for linear functions with boolean inputs 关于布尔输入线性函数(1 + λ)进化算法的第一次命中时间的注记

2009 IEEE Congress on Evolutionary Computation Pub Date : 2010-07-18 DOI: 10.1109/CEC.2010.5586055

Jun He

引用次数: 7

Species based evolutionary algorithms for multimodal optimization: A brief review 基于物种的多模态优化进化算法综述

2009 IEEE Congress on Evolutionary Computation Pub Date : 2010-07-18 DOI: 10.1109/CEC.2010.5586349

Jian-Ping Li, Xiaodong Li, A. Wood

引用次数: 32