journal
MENU ▼
Read by QxMD icon Read
search

Evolutionary Computation

journal
https://www.readbyqxmd.com/read/28632397/decomposition-algorithms-for-a-multi-hard-problem
#1
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 paper 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
#2
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
#3
Anton V Eremeev
In this paper, 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 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
#4
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
#5
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
#6
Evert Haasdijk, Jacqueline Heinerman
Selection is an essential component of any evolutionary systemand 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 in 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
#7
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
#8
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
#9
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
#10
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/26855136/global-wasf-ga-an-evolutionary-algorithm-in-multiobjective-optimization-to-approximate-the-whole-pareto-optimal-front
#11
Rubén Saborido, Ana B Ruiz, Mariano Luque
In this article, we propose a new evolutionary algorithm for multiobjective optimization called Global WASF-GA ( global weighting achievement scalarizing function genetic algorithm), which falls within the aggregation-based evolutionary algorithms. The main purpose of Global WASF-GA is to approximate the whole Pareto optimal front. Its fitness function is defined by an achievement scalarizing function (ASF) based on the Tchebychev distance, in which two reference points are considered (both utopian and nadir objective vectors) and the weight vector used is taken from a set of weight vectors whose inverses are well-distributed...
2017: Evolutionary Computation
https://www.readbyqxmd.com/read/26652102/novelty-driven-cooperative-coevolution
#12
Jorge Gomes, Pedro Mariano, Anders Lyhne Christensen
Cooperative coevolutionary algorithms (CCEAs) rely on multiple coevolving populations for the evolution of solutions composed of coadapted components. CCEAs enable, for instance, the evolution of cooperative multiagent systems composed of heterogeneous agents, where each agent is modelled as a component of the solution. Previous works have, however, shown that CCEAs are biased toward stability: the evolutionary process tends to converge prematurely to stable states instead of (near-)optimal solutions. In this study, we show how novelty search can be used to avoid the counterproductive attraction to stable states in coevolution...
2017: Evolutionary Computation
https://www.readbyqxmd.com/read/26581016/how-crossover-speeds-up-building-block-assembly-in%C3%A2-genetic%C3%A2-algorithms
#13
Dirk Sudholt
We reinvestigate a fundamental question: How effective is crossover in genetic algorithms in combining building blocks of good solutions? Although this has been discussed controversially for decades, we are still lacking a rigorous and intuitive answer. We provide such answers for royal road functions and OneMax, where every bit is a building block. For the latter, we show that using crossover makes every ([Formula: see text]+[Formula: see text]) genetic algorithm at least twice as fast as the fastest evolutionary algorithm using only standard bit mutation, up to small-order terms and for moderate [Formula: see text] and [Formula: see text]...
2017: Evolutionary Computation
https://www.readbyqxmd.com/read/26469220/principled-design-and-runtime-analysis-of-abstract%C3%A2-convex%C3%A2-evolutionary%C3%A2-search
#14
Alberto Moraglio, Dirk Sudholt
Geometric crossover is a formal class of crossovers that includes many well-known recombination operators across representations. In previous work, it was shown that all evolutionary algorithms with geometric crossover (but no mutation) do the same form of convex search regardless of the underlying representation, the specific selection mechanism, offspring distribution, search space, and problem at hand. Furthermore, it was suggested that the generalised convex search could perform well on generalised forms of concave and approximately concave fitness landscapes regardless of the underlying space and representation...
2017: Evolutionary Computation
https://www.readbyqxmd.com/read/26406166/extending-xcs-with-cyclic-graphs-for-scalability-on-complex-boolean-problems
#15
Muhammad Iqbal, Will N Browne, Mengjie Zhang
A main research direction in the field of evolutionary machine learning is to develop a scalable classifier system to solve high-dimensional problems. Recently work has begun on autonomously reusing learned building blocks of knowledge to scale from low-dimensional problems to high-dimensional ones. An XCS-based classifier system, known as XCSCFC, has been shown to be scalable, through the addition of expression tree-like code fragments, to a limit beyond standard learning classifier systems. XCSCFC is especially beneficial if the target problem can be divided into a hierarchy of subproblems and each of them is solvable in a bottom-up fashion...
2017: Evolutionary Computation
https://www.readbyqxmd.com/read/27982697/on-the-effectiveness-of-sampling-for-evolutionary-optimization-in-noisy-environments
#16
Chao Qian, Yang Yu, Ke Tang, Yaochu Jin, Xin Yao, Zhi-Hua Zhou
In real-world optimization tasks, the objective (i.e., fitness) function evaluation is often disturbed by noise due to a wide range of uncertainties. Evolutionary algorithms are often employed in noisy optimization, where reducing the negative effect of noise is a crucial issue. Sampling is a popular strategy for dealing with noise: to estimate the fitness of a solution, it evaluates the fitness multiple ([Formula: see text]) times independently and then uses the sample average to approximate the true fitness...
December 16, 2016: Evolutionary Computation
https://www.readbyqxmd.com/read/27982696/theoretical-and-empirical-analysis-of-a-spatial-ea-parallel-boosting-algorithm
#17
Uday Kamath, Carlotta Domeniconi, Kenneth De Jong
Many real-world problems involve massive amounts of data. Under these circumstances learning algorithms often become prohibitively expensive, making scalability a pressing issue to be addressed. A common approach is to perform sampling to reduce the size of the dataset and enable efficient learning. Alternatively, one customizes learning algorithms to achieve scalability. In either case, the key challenge is to obtain algorithmic efficiency without compromising the quality of the results. In this article we discuss a meta-learning algorithm (PSBML) that combines concepts from spatially structured evolutionary algorithms (SSEAs) with concepts from ensemble and boosting methodologies to achieve the desired scalability property...
December 16, 2016: Evolutionary Computation
https://www.readbyqxmd.com/read/27959580/performance-analysis-of-evolutionary-algorithms-for-steiner-tree-problems
#18
Xinsheng Lai, Yuren Zhou, Xiaoyun Xia, Qingfu Zhang
The Steiner tree problem (STP) aims to determine some Steiner nodes such that the minimum spanning tree over these Steiner nodes and a given set of special nodes has the minimum weight, which is NP-hard. STP includes several important cases. The Steiner tree problem in graphs (GSTP) is one of them. Many heuristics have been proposed for STP, and some of them have proved to be performance guarantee approximation algorithms for this problem. Since evolutionary algorithms (EAs) are general and popular randomized heuristics, it is significant to investigate the performance of EAs for STP...
December 13, 2016: Evolutionary Computation
https://www.readbyqxmd.com/read/27893278/expected-fitness-gains-of-randomized-search-heuristics-for-the-traveling-salesperson-problem
#19
Samadhi Nallaperuma, Frank Neumann, Dirk Sudholt
Randomized search heuristics are frequently applied to NP-hard combinatorial optimization problems. The runtime analysis of randomized search heuristics has contributed tremendously to our theoretical understanding. Recently, randomized search heuristics have been examined regarding their achievable progress within a fixed-time budget. We follow this approach and present a fixed-budget analysis for an NP-hard combinatorial optimization problem. We consider the well-known Traveling Salesperson Problem (TSP) and analyze the fitness increase that randomized search heuristics are able to achieve within a given fixed-time budget...
November 28, 2016: Evolutionary Computation
https://www.readbyqxmd.com/read/27819480/an-enhanced-memetic-algorithm-for-single-objective-bilevel-optimization-problems
#20
Md Monjurul Islam, Hemant Kumar Singh, Tapabrata Ray, Ankur Sinha
Bilevel optimization, as the name reflects, deals with optimization at two interconnected hierarchical levels. The aim is to identify the optimum of an upper-level leader problem, subject to the optimality of a lower-level follower problem. Several problems from the domain of engineering, logistics, economics, and transportation have an inherent nested structure which requires them to be modeled as bilevel optimization problems. Increasing size and complexity of such problems has prompted active theoretical and practical interest in the design of efficient algorithms for bilevel optimization...
November 7, 2016: 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"