journal
MENU ▼
Read by QxMD icon Read
search

Evolutionary Computation

journal
https://www.readbyqxmd.com/read/29155606/a-new-framework-for-analysis-of-coevolutionary-systems-directed-graph-representation-and-random-walks
#1
Siang Yew Chong, Peter Tiňo, Jun He, Xin Yao
Studying coevolutionary systems in the context of simplified models (i.e. games with pairwise interactions between coevolving solutions modelled as self plays) re-mains an open challenge since the rich underlying structures associated with pairwise-comparison-based fitness measures are often not taken fully into account. Although cyclic dynamics have been demonstrated in several contexts (such as intransitivity in coevolutionary problems), there is no complete characterization of cycle structures and their effects on coevolutionary search...
November 20, 2017: Evolutionary Computation
https://www.readbyqxmd.com/read/29155605/a-large-scale-experimental-evaluation-of-high-performing-multi-and-many-objective-evolutionary-algorithms
#2
Leonardo C T Bezerra, Manuel López-Ibáñez, Thomas Stützle
Research on multi-objective evolutionary algorithms (MOEAs) has produced over the past decades a large number of algorithms and a rich literature on performance assessment tools to evaluate and compare them. Yet, newly proposed MOEAs are typically compared against very few, often a decade older MOEAs. One reason for this apparent contradiction is the lack of a common baseline for comparison, with each subsequent study often devising its own experimental scenario, slightly different from other studies. As a result, the state of the art in MOEAs is a disputed topic...
November 20, 2017: Evolutionary Computation
https://www.readbyqxmd.com/read/29155604/modelling-evolutionary-algorithms-with-stochastic-differential-equations
#3
Jorge Pérez Heredia
There has been renewed interest in modelling the behaviour of evolutionary algorithms (EAs) by more traditional mathematical objects, such as ordinary differential equations or Markov chains. The advantage is that the analysis becomes greatly facilitated due to the existence of well established methods. However, this typically comes at the cost of disregarding information about the process. Here, we introduce the use of stochastic differential equations (SDEs) for the study of EAs. SDEs can produce simple analytical results for the dynamics of stochastic processes, unlike Markov chains which can produce rigorous but unwieldy expressions about the dynamics...
November 20, 2017: Evolutionary Computation
https://www.readbyqxmd.com/read/28836836/leveraging-tsp-solver-complementarity-through-machine-learning
#4
Pascal Kerschke, Lars Kotthoff, Jakob Bossek, Holger H Hoos, Heike Trautmann
The Travelling Salesperson Problem (TSP) is one of the best-studied NP-hard problems. Over the years, many different solution approaches and solvers have been developed. For the first time, we directly compare five state-of-the-art inexact solvers - namely, LKH, EAX, restart variants of those, and MAOS - on a large set of well-known benchmark instances and demonstrate complementary performance, in that different instances may be solved most effectively by different algorithms. We leverage this complementarity to build an algorithm selector, which selects the best TSP solver on a per-instance basis and thus achieves significantly improved performance compared to the single best solver, representing an advance in the state of the art in solving the Euclidean TSP...
August 24, 2017: Evolutionary Computation
https://www.readbyqxmd.com/read/28791882/cooperative-co-evolution-with-formula-based-variable-grouping-for-large-scale-global-optimization
#5
Yuping Wang, Haiyan Liu, Fei Wei, Tingting Zong, Xiaodong Li
For a large-scale global optimization (LSGO) problem, divide-and-conquer is usually considered as an effective strategy to decompose the problem into smaller subproblems, each of which can be then solved individually. Among these decomposition methods, variable grouping is shown to be promising in recent years. Existing variable grouping methods usually assume the problem to be black-box (i.e., assuming that an analytical model of the objective function is unknown), and they attempt to learn appropriate variable grouping that would allow for a better decomposition of the problem...
August 9, 2017: Evolutionary Computation
https://www.readbyqxmd.com/read/28661707/using-hadoop-mapreduce-for-parallel-genetic-algorithms-a-comparison-of-the-global-grid-and-island-models
#6
Filomena Ferrucci, Pasquale Salza, Federica Sarro
The need to improve the scalability of Genetic Algorithms (GAs) has motivated the research on Parallel Genetic Algorithms (PGAs), and different technologies and approaches have been used. Hadoop MapReduce represents one of the most mature technologies to develop parallel algorithms. Based on the fact that parallel algorithms introduce communication overhead, the aim of the present work is to understand if, and possibly when, the parallel GAs solutions using Hadoop MapReduce show better performance than sequential versions in terms of execution time...
June 29, 2017: Evolutionary Computation
https://www.readbyqxmd.com/read/28632397/decomposition-algorithms-for-a-multi-hard-problem
#7
M R Przybylek, A Wierzbicki, Z Michalewicz
Real-world optimization problems have been studied in the past, but the work resulted in approaches tailored to individual problems that could not be easily generalized. The reason for this limitation was the lack of appropriate models for the systematic study of salient aspects of real-world problems. The aim of this article is to study one of such aspects: multi-hardness. We propose a variety of decomposition-based algorithms for an abstract multi-hard problem and compare them against the most promising heuristics...
June 20, 2017: Evolutionary Computation
https://www.readbyqxmd.com/read/28632396/probabilistic-analysis-of-the-1-1-evolutionary-algorithm
#8
Hsien-Kuei Hwang, Alois Panholzer, Nicolas Rolin, Tsung-Hsi Tsai, Wei-Mei Chen
We give a detailed analysis of the optimization time of the (1 + 1)-Evolutionary Algorithm under two simple fitness functions (OneMax and LeadingOnes). The problem has been approached in the evolutionary algorithm literature in various ways and with different degrees of rigor. Our asymptotic approximations for the mean and the variance represent the strongest of their kind. The approach we develop is based on an asymptotic resolution of the underlying recurrences and can also be extended to characterize the corresponding limiting distributions...
June 20, 2017: Evolutionary Computation
https://www.readbyqxmd.com/read/28489414/on-proportions-of-fit-individuals-in-population-of-mutation-based-evolutionary-algorithm-with-tournament-selection
#9
Anton V Eremeev
In this article, we consider a fitness-level model of a non-elitist mutation-only evolutionary algorithm (EA) with tournament selection. The model provides upper and lower bounds for the expected proportion of the individuals with fitness above given thresholds. In the case of so-called monotone mutation, the obtained bounds imply that increasing the tournament size improves the EA performance. As corollaries, we obtain an exponentially vanishing tail bound for the Randomized Local Search on unimodal functions and polynomial upper bounds on the runtime of EAs on the 2-SAT problem and on a family of Set Cover problems proposed by E...
May 10, 2017: Evolutionary Computation
https://www.readbyqxmd.com/read/28388221/exploiting-linkage-information-and-problem-specific-knowledge-in-evolutionary-distribution-network-expansion-planning
#10
Ngoc Hoang Luong, Han La Poutré, Peter A N Bosman
This article tackles the Distribution Network Expansion Planning (DNEP) problemthat has to be solved by distribution network operators to decide which, where, and/or when enhancements to electricity networks should be introduced to satisfy the future power demands. Because of many real-world details involved, the structure of the problem is not exploited easily using mathematical programming techniques, for which reason we consider solving this problem with evolutionary algorithms (EAs). We compare three types of EAs for optimizing expansion plans: the classic genetic algorithm (GA), the estimation-of-distribution algorithm (EDA), and the Gene-pool Optimal Mixing Evolutionary Algorithm (GOMEA)...
April 7, 2017: Evolutionary Computation
https://www.readbyqxmd.com/read/28358647/co-optimization-free-lunches-tractability-of-optimal-black-box-algorithms-for-maximizing-expected-utility
#11
Elena Popovici
Co-optimization problems often involve settings in which the quality ( utility) of a potential solution is dependent on the scenario within which it is evaluated, and many such scenarios exist. Maximizing expected utility is simply the goal of finding the potential solution whose expected utility value over all possible scenarios is best. Such problems are often approached using coevolutionary algorithms. We are interested in the design of generally well-performing black-box algorithms for this problem, that is algorithms which have access to the utility function only via input-output queries...
March 30, 2017: Evolutionary Computation
https://www.readbyqxmd.com/read/28323435/quantifying-selection-pressure
#12
Evert Haasdijk, Jacqueline Heinerman
Selection is an essential component of any evolutionary system and analysing this fundamental force in evolution can provide relevant insights into the evolutionary development of a population. The 1990s and early 2000s saw a substantial number of publications that investigated selection pressure through methods such as takeover time and Markov chain analysis. Over the last decade, however, interest in the analysis of selection in evolutionary computing has waned. The established methods for analysis of selection pressure provide little insight when selection is based on more than comparison-of-fitness values...
March 21, 2017: Evolutionary Computation
https://www.readbyqxmd.com/read/28207296/gambit-a-parameterless-model-based-evolutionary-algorithm-for-mixed-integer-problems
#13
Krzysztof L Sadowski, Dirk Thierens, Peter A N Bosman
Learning and exploiting problem structure is one of the key challenges in optimization. This is especially important for black-box optimization (BBO) where prior structural knowledge of a problem is not available. Existing model-based Evolutionary Algorithms (EAs) are very efficient at learning structure in both the discrete, and in the continuous domain. In this paper, discrete and continuous model-building mechanisms are integrated for the Mixed-Integer (MI) domain, comprising discrete and continuous variables...
February 16, 2017: Evolutionary Computation
https://www.readbyqxmd.com/read/28207295/competent-geometric-semantic-genetic-programming-for-symbolic-regression-and-boolean-function-synthesis
#14
Tomasz P Pawlak, Krzysztof Krawiec
Program semantics is a promising recent research thread in Genetic Programming (GP). Over a dozen of semantic-aware search, selection, and initialization operators for GP have been proposed to date. Some of those operators are designed to exploit the geometric properties of semantic space, while some others focus on making offspring effective, i.e., semantically different from their parents. Only a small fraction of previous works aimed at addressing both these features simultaneously. In this paper, we propose a suite of competent operators that combine effectiveness with geometry for population initialization, mate selection, mutation and crossover...
February 16, 2017: Evolutionary Computation
https://www.readbyqxmd.com/read/28103060/a-new-algorithm-using-the-non-dominated-tree-to-improve-non-dominated-sorting
#15
Patrik Gustavsson, Anna Syberfeldt
Non-dominated sorting is a technique often used in evolutionary algorithms to determine the quality of solutions in a population. The most common algorithm is the Fast Non-dominated Sort (FNS). This algorithm, however, has the drawback that its performance deteriorates when the population size grows. The same drawback applies also to other non-dominating sorting algorithms such as the Efficient Non-dominated Sort with Binary Strategy (ENS-BS). An algorithm suggested to overcome this drawback is the Divide-and-Conquer Non-dominated Sort (DCNS) which works well on a limited number of objectives but deteriorates when the number of objectives grows...
January 19, 2017: Evolutionary Computation
https://www.readbyqxmd.com/read/28072555/on-constructing-ensembles-for-combinatorial-optimisation
#16
Emma Hart, Kevin Sim
Although the use of ensemble methods in machine-learning is ubiquitous due to their proven ability to outperform their constituent algorithms, ensembles of optimisation algorithms have received relatively little attention. Existing approaches lag behind machine-learning in both theory and practice, with no principled design guidelines available. In this article, we address fundamental questions regarding ensemble composition in optimisation using the domain of bin-packing as an example. In particular, we investigate the trade-off between accuracy and diversity, and whether diversity metrics can be used as a proxy for constructing an ensemble, proposing a number of novel metrics for comparing algorithm diversity...
January 10, 2017: Evolutionary Computation
https://www.readbyqxmd.com/read/27700279/a-probabilistic-reformulation-of-no-free-lunch-continuous-lunches-are-not-free
#17
Alan J Lockett, Risto Miikkulainen
No Free Lunch (NFL) theorems have been developed in many settings over the last two decades. Whereas NFL is known to be possible in any domain based on set-theoretic concepts, probabilistic versions of NFL are presently believed to be impossible in continuous domains. This article develops a new formalization of probabilistic NFL that is sufficiently expressive to prove the existence of NFL in large search domains, such as continuous spaces or function spaces. This formulation is arguably more complicated than its set-theoretic variants, mostly as a result of the numerous technical complications within probability theory itself...
2017: Evolutionary Computation
https://www.readbyqxmd.com/read/27258841/a-hidden-markov-model-approach-to-the-problem-of-heuristic-selection-in-hyper-heuristics-with-a-case-study-in-high-school-timetabling-problems
#18
Ahmed Kheiri, Ed Keedwell
Operations research is a well-established field that uses computational systems to support decisions in business and public life. Good solutions to operations research problems can make a large difference to the efficient running of businesses and organisations and so the field often searches for new methods to improve these solutions. The high school timetabling problem is an example of an operations research problem and is a challenging task which requires assigning events and resources to time slots subject to a set of constraints...
2017: Evolutionary Computation
https://www.readbyqxmd.com/read/27070282/multimodal-optimization-by-covariance-matrix-self-adaptation-evolution-strategy-with-repelling-subpopulations
#19
Ali Ahrari, Kalyanmoy Deb, Mike Preuss
During the recent decades, many niching methods have been proposed and empirically verified on some available test problems. They often rely on some particular assumptions associated with the distribution, shape, and size of the basins, which can seldom be made in practical optimization problems. This study utilizes several existing concepts and techniques, such as taboo points, normalized Mahalanobis distance, and the Ursem's hill-valley function in order to develop a new tool for multimodal optimization, which does not make any of these assumptions...
2017: Evolutionary Computation
https://www.readbyqxmd.com/read/26953883/particle-swarm-optimization-for-single-objective-continuous-space-problems-a-review
#20
REVIEW
Mohammad Reza Bonyadi, Zbigniew Michalewicz
This paper reviews recent studies on the Particle Swarm Optimization (PSO) algorithm. The review has been focused on high impact recent articles that have analyzed and/or modified PSO algorithms. This paper also presents some potential areas for future study.
2017: Evolutionary Computation
journal
journal
32347
1
2
Fetch more papers »
Fetching more papers... Fetching...
Read by QxMD. Sign in or create an account to discover new knowledge that matter to you.
Remove bar
Read by QxMD icon Read
×

Search Tips

Use Boolean operators: AND/OR

diabetic AND foot
diabetes OR diabetic

Exclude a word using the 'minus' sign

Virchow -triad

Use Parentheses

water AND (cup OR glass)

Add an asterisk (*) at end of a word to include word stems

Neuro* will search for Neurology, Neuroscientist, Neurological, and so on

Use quotes to search for an exact phrase

"primary prevention of cancer"
(heart or cardiac or cardio*) AND arrest -"American Heart Association"