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

Evolutionary Computation最新文献

筛选
英文 中文
Characterizing Permutation-Based Combinatorial Optimization Problems in Fourier Space 傅立叶空间中基于置换的组合优化问题的表征
IF 6.8 2区 计算机科学
Evolutionary Computation Pub Date : 2023-09-01 DOI: 10.1162/evco_a_00315
Anne Elorza;Leticia Hernando;Jose A. Lozano
{"title":"Characterizing Permutation-Based Combinatorial Optimization Problems in Fourier Space","authors":"Anne Elorza;Leticia Hernando;Jose A. Lozano","doi":"10.1162/evco_a_00315","DOIUrl":"10.1162/evco_a_00315","url":null,"abstract":"Comparing combinatorial optimization problems is a difficult task. They are defined using different criteria and terms: weights, flows, distances, etc. In spite of this apparent discrepancy, on many occasions, they tend to produce problem instances with similar properties. One avenue to compare different problems is to project them onto the same space, in order to have homogeneous representations. Expressing the problems in a unified framework could also lead to the discovery of theoretical properties or the design of new algorithms. This article proposes the use of the Fourier transform over the symmetric group as the tool to project different permutation-based combinatorial optimization problems onto the same space. Based on a previous study (Kondor, 2010), which characterized the Fourier coefficients of the quadratic assignment problem, we describe the Fourier coefficients of three other well-known problems: the symmetric and nonsymmetric traveling salesperson problem and the linear ordering problem. This transformation allows us to gain a better understanding of the intersection between the problems, as well as to bound their intrinsic dimension.","PeriodicalId":50470,"journal":{"name":"Evolutionary Computation","volume":"31 3","pages":"163-199"},"PeriodicalIF":6.8,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"10141954","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Evolutionary and Estimation of Distribution Algorithms for Unconstrained, Constrained, and Multiobjective Noisy Combinatorial Optimisation Problems 无约束、约束和多目标噪声组合优化问题的分布算法的进化和估计
IF 6.8 2区 计算机科学
Evolutionary Computation Pub Date : 2023-09-01 DOI: 10.1162/evco_a_00320
Aishwaryaprajna;Jonathan E. Rowe
{"title":"Evolutionary and Estimation of Distribution Algorithms for Unconstrained, Constrained, and Multiobjective Noisy Combinatorial Optimisation Problems","authors":"Aishwaryaprajna;Jonathan E. Rowe","doi":"10.1162/evco_a_00320","DOIUrl":"10.1162/evco_a_00320","url":null,"abstract":"We present an empirical study of a range of evolutionary algorithms applied to various noisy combinatorial optimisation problems. There are three sets of experiments. The first looks at several toy problems, such as OneMax and other linear problems. We find that UMDA and the Paired-Crossover Evolutionary Algorithm (PCEA) are the only ones able to cope robustly with noise, within a reasonable fixed time budget. In the second stage, UMDA and PCEA are then tested on more complex noisy problems: SubsetSum, Knapsack, and SetCover. Both perform well under increasing levels of noise, with UMDA being the better of the two. In the third stage, we consider two noisy multiobjective problems (CountingOnesCountingZeros and a multiobjective formulation of SetCover). We compare several adaptations of UMDA for multiobjective problems with the Simple Evolutionary Multiobjective Optimiser (SEMO) and NSGA-II. We conclude that UMDA, and its variants, can be highly effective on a variety of noisy combinatorial optimisation, outperforming many other evolutionary algorithms.","PeriodicalId":50470,"journal":{"name":"Evolutionary Computation","volume":"31 3","pages":"259-285"},"PeriodicalIF":6.8,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"10141100","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Contributions to Dynamic Analysis of Differential Evolution Algorithms 差分进化算法动态分析的贡献
IF 6.8 2区 计算机科学
Evolutionary Computation Pub Date : 2023-09-01 DOI: 10.1162/evco_a_00318
Lucas Resende;Ricardo H. C. Takahashi
{"title":"Contributions to Dynamic Analysis of Differential Evolution Algorithms","authors":"Lucas Resende;Ricardo H. C. Takahashi","doi":"10.1162/evco_a_00318","DOIUrl":"10.1162/evco_a_00318","url":null,"abstract":"The Differential Evolution (DE) algorithm is one of the most successful evolutionary computation techniques. However, its structure is not trivially translatable in terms of mathematical transformations that describe its population dynamics. In this work, analytical expressions are developed for the probability of enhancement of individuals after each application of a mutation operator followed by a crossover operation, assuming a population distributed radially around the optimum for the sphere objective function, considering the DE/rand/1/bin and the DE/rand/1/exp algorithm versions. These expressions are validated by numerical experiments. Considering quadratic functions given by f(x)=xTDTDx and populations distributed according to the linear transformation D-1 of a radially distributed population, it is also shown that the expressions still hold in the cases when f(x) is separable (D is diagonal) and when D is any nonsingular matrix and the crossover rate is Cr=1.0. The expressions are employed for the analysis of DE population dynamics. The analysis is extended to more complex situations, reaching rather precise predictions of the effect of problem dimension and of the choice of algorithm parameters.","PeriodicalId":50470,"journal":{"name":"Evolutionary Computation","volume":"31 3","pages":"201-232"},"PeriodicalIF":6.8,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"10144079","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Personal Perspective on Evolutionary Computation: A 35-Year Journey 个人对进化计算的看法:35年的历程
IF 6.8 2区 计算机科学
Evolutionary Computation Pub Date : 2023-06-01 DOI: 10.1162/evco_a_00323
Zbigniew Michalewicz
{"title":"A Personal Perspective on Evolutionary Computation: A 35-Year Journey","authors":"Zbigniew Michalewicz","doi":"10.1162/evco_a_00323","DOIUrl":"10.1162/evco_a_00323","url":null,"abstract":"This paper presents a personal account of the author's 35 years “adventure” with Evolutionary Computation—from the first encounter in 1988 and many years of academic research through to working full-time in business—successfully implementing evolutionary algorithms for some of the world's largest corporations. The paper concludes with some observations and insights.","PeriodicalId":50470,"journal":{"name":"Evolutionary Computation","volume":"31 2","pages":"123-155"},"PeriodicalIF":6.8,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9662509","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Evolutionary Algorithms for Parameter Optimization—Thirty Years Later 参数优化的进化算法-三十年后
IF 6.8 2区 计算机科学
Evolutionary Computation Pub Date : 2023-06-01 DOI: 10.1162/evco_a_00325
Thomas H. W. Bäck;Anna V. Kononova;Bas van Stein;Hao Wang;Kirill A. Antonov;Roman T. Kalkreuth;Jacob de Nobel;Diederick Vermetten;Roy de Winter;Furong Ye
{"title":"Evolutionary Algorithms for Parameter Optimization—Thirty Years Later","authors":"Thomas H. W. Bäck;Anna V. Kononova;Bas van Stein;Hao Wang;Kirill A. Antonov;Roman T. Kalkreuth;Jacob de Nobel;Diederick Vermetten;Roy de Winter;Furong Ye","doi":"10.1162/evco_a_00325","DOIUrl":"10.1162/evco_a_00325","url":null,"abstract":"Thirty years, 1993–2023, is a huge time frame in science. We address some major developments in the field of evolutionary algorithms, with applications in parameter optimization, over these 30 years. These include the covariance matrix adaptation evolution strategy and some fast-growing fields such as multimodal optimization, surrogate-assisted optimization, multiobjective optimization, and automated algorithm design. Moreover, we also discuss particle swarm optimization and differential evolution, which did not exist 30 years ago, either. One of the key arguments made in the paper is that we need fewer algorithms, not more, which, however, is the current trend through continuously claiming paradigms from nature that are suggested to be useful as new optimization algorithms. Moreover, we argue that we need proper benchmarking procedures to sort out whether a newly proposed algorithm is useful or not. We also briefly discuss automated algorithm design approaches, including configurable algorithm design frameworks, as the proposed next step toward designing optimization algorithms automatically, rather than by hand.","PeriodicalId":50470,"journal":{"name":"Evolutionary Computation","volume":"31 2","pages":"81-122"},"PeriodicalIF":6.8,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9664596","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Editorial: Reflecting on Thirty Years of ECJ 社论:欧洲法院三十年的反思
IF 6.8 2区 计算机科学
Evolutionary Computation Pub Date : 2023-06-01 DOI: 10.1162/evco_e_00324
Kenneth De Jong;Emma Hart
{"title":"Editorial: Reflecting on Thirty Years of ECJ","authors":"Kenneth De Jong;Emma Hart","doi":"10.1162/evco_e_00324","DOIUrl":"10.1162/evco_e_00324","url":null,"abstract":"We reflect on 30 years of the journal Evolutionary Computation. Taking the papers published in the first volume in 1993 as a springboard, as the founding and current Editors-in-Chief, we comment on the beginnings of the field, evaluate the extent to which the field has both grown and itself evolved, and provide our own perpectives on where the future lies.","PeriodicalId":50470,"journal":{"name":"Evolutionary Computation","volume":"31 2","pages":"73-79"},"PeriodicalIF":6.8,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9670242","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Personal Reflections on Some Early Work in Evolving Strategies in the Iterated Prisoner's Dilemma 对囚徒困境演化策略早期研究的个人思考
IF 6.8 2区 计算机科学
Evolutionary Computation Pub Date : 2023-06-01 DOI: 10.1162/evco_a_00322
David B. Fogel
{"title":"Personal Reflections on Some Early Work in Evolving Strategies in the Iterated Prisoner's Dilemma","authors":"David B. Fogel","doi":"10.1162/evco_a_00322","DOIUrl":"10.1162/evco_a_00322","url":null,"abstract":"On the occasion of the 30-year anniversary of the Evolutionary Computation journal, I was invited by Professor Hart to offer some reflections on the article on evolving behaviors in the iterated prisoner's dilemma that I contributed to its first issue in 1993. It's an honor to do so. I would like to thank Professor Ken De Jong, the journal's first editor-in-chief, for his vision in creating the journal, and the editors who have followed and maintained that vision. This article contains some personal reflections on the topic and the field as a whole.","PeriodicalId":50470,"journal":{"name":"Evolutionary Computation","volume":"31 2","pages":"157-161"},"PeriodicalIF":6.8,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9670243","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Stagnation Detection with Randomized Local Search* 基于随机局部搜索的停滞检测*
IF 6.8 2区 计算机科学
Evolutionary Computation Pub Date : 2023-03-01 DOI: 10.1162/evco_a_00313
Amirhossein Rajabi;Carsten Witt
{"title":"Stagnation Detection with Randomized Local Search*","authors":"Amirhossein Rajabi;Carsten Witt","doi":"10.1162/evco_a_00313","DOIUrl":"10.1162/evco_a_00313","url":null,"abstract":"Recently a mechanism called stagnation detection was proposed that automatically adjusts the mutation rate of evolutionary algorithms when they encounter local optima. The so-called SD-(1+1) EA introduced by Rajabi and Witt (2022) adds stagnation detection to the classical (1+1) EA with standard bit mutation. This algorithm flips each bit independently with some mutation rate, and stagnation detection raises the rate when the algorithm is likely to have encountered a local optimum. In this article, we investigate stagnation detection in the context of the k-bit flip operator of randomized local search that flips k bits chosen uniformly at random and let stagnation detection adjust the parameter k. We obtain improved runtime results compared with the SD-(1+1) EA amounting to a speedup of at least (1-o(1))2πm, where m is the so-called gap size, that is, the distance to the next improvement. Moreover, we propose additional schemes that prevent infinite optimization times even if the algorithm misses a working choice of k due to unlucky events. Finally, we present an example where standard bit mutation still outperforms the k-bit flip operator with stagnation detection.","PeriodicalId":50470,"journal":{"name":"Evolutionary Computation","volume":"31 1","pages":"1-29"},"PeriodicalIF":6.8,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9359552","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 27
An Uncertainty Measure for Prediction of Non-Gaussian Process Surrogates 非高斯过程替代物预测的不确定度度量
IF 6.8 2区 计算机科学
Evolutionary Computation Pub Date : 2023-03-01 DOI: 10.1162/evco_a_00316
Caie Hu;Sanyou Zeng;Changhe Li
{"title":"An Uncertainty Measure for Prediction of Non-Gaussian Process Surrogates","authors":"Caie Hu;Sanyou Zeng;Changhe Li","doi":"10.1162/evco_a_00316","DOIUrl":"10.1162/evco_a_00316","url":null,"abstract":"Model management is an essential component in data-driven surrogate-assisted evolutionary optimization. In model management, the solutions with a large degree of uncertainty in approximation play an important role. They can strengthen the exploration ability of algorithms and improve the accuracy of surrogates. However, there is no theoretical method to measure the uncertainty of prediction of Non-Gaussian process surrogates. To address this issue, this article proposes a method to measure the uncertainty. In this method, a stationary random field with a known zero mean is used to measure the uncertainty of prediction of Non-Gaussian process surrogates. Based on experimental analyses, this method is able to measure the uncertainty of prediction of Non-Gaussian process surrogates. The method's effectiveness is demonstrated on a set of benchmark problems in single surrogate and ensemble surrogates cases.","PeriodicalId":50470,"journal":{"name":"Evolutionary Computation","volume":"31 1","pages":"53-71"},"PeriodicalIF":6.8,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"10801408","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Hybridization of Evolutionary Operators with Elitist Iterated Racing for the Simulation Optimization of Traffic Lights Programs 混合进化算子与精英迭代竞速的交通信号灯仿真优化
IF 6.8 2区 计算机科学
Evolutionary Computation Pub Date : 2023-03-01 DOI: 10.1162/evco_a_00314
Christian Cintrano;Javier Ferrer;Manuel López-Ibáñez;Enrique Alba
{"title":"Hybridization of Evolutionary Operators with Elitist Iterated Racing for the Simulation Optimization of Traffic Lights Programs","authors":"Christian Cintrano;Javier Ferrer;Manuel López-Ibáñez;Enrique Alba","doi":"10.1162/evco_a_00314","DOIUrl":"10.1162/evco_a_00314","url":null,"abstract":"In the traffic light scheduling problem, the evaluation of candidate solutions requires the simulation of a process under various (traffic) scenarios. Thus, good solutions should not only achieve good objective function values, but they must be robust (low variance) across all different scenarios. Previous work has shown that combining IRACE with evolutionary operators is effective for this task due to the power of evolutionary operators in numerical optimization. In this article, we further explore the hybridization of evolutionary operators and the elitist iterated racing of IRACE for the simulation–optimization of traffic light programs. We review previous works from the literature to find the evolutionary operators performing the best when facing this problem to propose new hybrid algorithms. We evaluate our approach over a realistic case study derived from the traffic network of Málaga (Spain) with 275 traffic lights that should be scheduled optimally. The experimental analysis reveals that the hybrid algorithm comprising IRACE plus differential evolution offers statistically better results than the other algorithms when the budget of simulations is low. In contrast, IRACE performs better than the hybrids for a high simulations budget, although the optimization time is much longer.","PeriodicalId":50470,"journal":{"name":"Evolutionary Computation","volume":"31 1","pages":"31-51"},"PeriodicalIF":6.8,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"10814046","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"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学术官方微信