journal
MENU ▼
Read by QxMD icon Read
search

Evolutionary Computation

journal
https://www.readbyqxmd.com/read/29932364/theoretical-analysis-of-local-search-and-simple-evolutionary-algorithms-for-the-generalized-travelling-salesperson-problem
#1
Mojgan Pourhassan, Frank Neumann
The generalized travelling salesperson problem is an important NP-hard combinatorial optimization problem for which meta-heuristics, such as local search and evolutionary algorithms, have been used very successfully. Two hierarchical approaches with different neighbourhood structures, namely a Cluster-Based approach and a Node-Based approach, have been proposed by Hu and Raidl (2008) for solving this problem. In this paper, local search algorithms and simple evolutionary algorithms based on these approaches are investigated from a theoretical perspective...
June 22, 2018: Evolutionary Computation
https://www.readbyqxmd.com/read/29932363/emergent-solutions-to-high-dimensional-multi-task-reinforcement-learning
#2
Stephen Kelly, Malcolm I Heywood
Algorithms that learn through environmental interaction and delayed rewards, or reinforcement learning, increasingly face the challenge of scaling to dynamic, highdimensional, and partially observable environments. Significant attention is being paid to frameworks from deep learning, which scale to high-dimensional data by decomposing the task through multi-layered neural networks. While effective, the representation is complex and computationally demanding. In this work we propose a framework based on Genetic Programming which adaptively complexifies policies through interaction with the task...
June 22, 2018: Evolutionary Computation
https://www.readbyqxmd.com/read/29883202/data-efficient-design-exploration-through-surrogate-assisted-illumination
#3
Adam Gaier, Alexander Asteroth, Jean-Baptiste Mouret
Design optimization techniques are often used at the beginning of the design process to explore the space of possible designs. In these domains illumination algorithms, such as MAP-Elites, are promising alternatives to classic optimization algorithms because they produce diverse, high-quality solutions in a single run, instead of only a single near-optimal solution. Unfortunately, these algorithms currently require a large number of function evaluations, limiting their applicability. In this article we introduce a new illumination algorithm, Surrogate-Assisted Illumination (SAIL), that leverages surrogate modeling techniques to create a map of the design space according to user-defined features while minimizing the number of fitness evaluations...
June 8, 2018: Evolutionary Computation
https://www.readbyqxmd.com/read/29863421/adaptive-fitness-predictors-in-coevolutionary-cartesian-genetic-programming
#4
Michaela Drahosova, Lukas Sekanina, Michal Wiglasz
In genetic programming (GP), computer programs are often coevolved with training data subsets that are known as fitness predictors. In order to maximize performance of GP, it is important to find the most suitable parameters of coevolution, particularly the fitness predictor size. This is a very time consuming process as the predictor size depends on a given application and many experiments have to be performed to find its suitable size. A new method is proposed which enables us to automatically adapt the predictor and its size for a given problem and thus to reduce not only the time of evolution, but also the time needed to tune the evolutionary algorithm...
June 4, 2018: Evolutionary Computation
https://www.readbyqxmd.com/read/29863420/a-hybrid-genetic-programming-algorithm-for-automated-design-of-dispatching-rules
#5
Su Nguyen, Yi Mei, Bing Xue, Mengjie Zhang
Designing effective dispatching rules for production systems is a difficult and timeconsuming task if it is done manually. In the last decade, the growth of computing power, advanced machine learning, and optimisation techniques has made the automated design of dispatching rules possible and automatically discovered rules are competitive or outperform existing rules developed by researchers. Genetic programming is one of the most popular approaches to discovering dispatching rules in the literature, especially for complex production systems...
June 4, 2018: Evolutionary Computation
https://www.readbyqxmd.com/read/29786460/counterexample-driven-genetic-programming-heuristic-program-synthesis-from-formal-specifications
#6
Iwo Błądek, Krzysztof Krawiec, Jerry Swan
Conventional genetic programming (GP) can only guarantee that synthesized programs pass tests given by the provided input-output examples. The alternative to such test-based approach is synthesizing programs by formal specification, typically realized with exact, non-heuristic algorithms. In this paper, we build on our earlier study on Counterexample-Based Genetic Programming (CDGP), an evolutionary heuristic that synthesizes programs from formal specifications. The candidate programs in CDGP undergo formal verification with a Satisfiability Modulo Theory (SMT) solver, which results in counterexamples that are subsequently turned into tests and used to calculate fitness...
May 22, 2018: Evolutionary Computation
https://www.readbyqxmd.com/read/29786459/anatomy-of-the-attraction-basins-breaking-with-the-intuition
#7
Leticia Hernando, Alexander Mendiburu, Jose A Lozano
Solving combinatorial optimization problems efficiently requires the development of algorithms that consider the specific properties of the problems. In this sense, local search algorithms are designed over a neighborhood structure that partially accounts for these properties. Considering a neighborhood, the space is usually interpreted as a natural landscape, with valleys and mountains. Under this perception, it is commonly believed that, if maximizing, the solutions located in the slopes of the same mountain belong to the same attraction basin, with the peaks of the mountains being the local optima...
May 22, 2018: Evolutionary Computation
https://www.readbyqxmd.com/read/29786458/how-to-specify-a-reference-point-in-hypervolume-calculation-for-fair-performance-comparison
#8
Hisao Ishibuchi, Ryo Imada, Yu Setoguchi, Yusuke Nojima
The hypervolume indicator has frequently been used for comparing evolutionary multi-objective optimization (EMO) algorithms. A reference point is needed for hypervolume calculation. However, its specification has not been discussed in detail from a viewpoint of fair performance comparison. A slightly worse point than the nadir point is usually used for hypervolume calculation in the EMO community. In this paper, we propose a reference point specification method for fair performance comparison of EMO algorithms...
May 22, 2018: Evolutionary Computation
https://www.readbyqxmd.com/read/29746158/on-the-runtime-analysis-of-the-clearing-diversity-preserving-mechanism
#9
Edgar Covantes Osuna, Dirk Sudholt
Clearing is a niching method inspired by the principle of assigning the available resources among a niche to a single individual. The clearing procedure supplies these resources only to the best individual of each niche: the winner. So far, its analysis has been focused on experimental approaches that have shown that clearing is a powerful diversity-preserving mechanism. Using rigorous runtime analysis to explain how and why it is a powerful method, we prove that a mutation-based evolutionary algorithm with a large enough population size, and a phenotypic distance function always succeeds in optimising all functions of unitation for small niches in polynomial time, while a genotypic distance function requires exponential time...
May 10, 2018: Evolutionary Computation
https://www.readbyqxmd.com/read/29746157/a-probabilistic-and-multi-objective-analysis-of-lexicase-selection-and-%C3%AE%C2%B5-lexicase-selection
#10
William La Cava, Thomas Helmuth, Lee Spector, Jason H Moore
Lexicase selection is a parent selection method that considers training cases individually, rather than in aggregate, when performing parent selection. Whereas previous work has demonstrated the ability of lexicase selection to solve difficult problems in program synthesis and symbolic regression, the central goal of this paper is to develop the theoretical underpinnings that explain its performance. To this end, we derive an analytical formula that gives the expected probabilities of selection under lexicase selection, given a population and its behavior...
May 10, 2018: Evolutionary Computation
https://www.readbyqxmd.com/read/29714503/hyperplane-approximation-based-method-for-many-objective-optimization-problems-with-redundant-objectives
#11
Yifan Li, Hai-Lin Liu, E D Goodman
For a many-objective optimization problem with redundant objectives, we propose two novel objective reduction algorithms for linearly and nonlinearly degenerate Pareto fronts. They are respectively called LHA and NLHA. The main idea of the proposed algorithms is to use a hyperplane with non-negative sparse coefficients to roughly approximate the structure of the PF. This approach is quite different from the previous objective reduction algorithms that are based on correlation or dominance structure. Especially in NLHA, in order to reduce the approximation error, we transform a nonlinearly degenerate Pareto front into a nearly linearly degenerate Pareto front via a power transformation...
May 1, 2018: Evolutionary Computation
https://www.readbyqxmd.com/read/29528726/constraint-handling-guided-by-landscape-analysis-in-combinatorial-and-continuous-search-spaces
#12
Katherine M Malan, I Moser
The notion and characterisation of fitness landscapes has helped understand the performance of heuristic algorithms on complex optimisation problems. Many practical problems, however, are constrained, and when significant areas of the search space are infeasible, researchers have intuitively resorted to a variety of constraint-handling techniques intended to help the algorithm manoeuvre through infeasible areas and towards feasible regions of better fitness. It is clear that providing constraint-related feedback to the algorithm to influence its choice of solutions overlays the violation landscape with the fitness landscape in unpredictable ways whose effects on the algorithm cannot be directly measured...
March 12, 2018: Evolutionary Computation
https://www.readbyqxmd.com/read/29528725/towards-automation-augmentation-of-the-design-of-schedulers-for-cellular-communications-networks
#13
Michael Fenton, David Lynch, David Fagan, Stepan Kucera, Holger Claussen, Michael O'Neill
Evolutionary Computation is used to automatically evolve small cell schedulers on a realistic simulation of a 4G-LTE heterogeneous cellular network. Evolved schedulers are then further augmented by human design to improve robustness. Extensive analysis of evolved solutions and their performance across a wide range of metrics reveals evolution has uncovered a new human-competitive scheduling technique which generalises well across cells of varying sizes. Furthermore, evolved methods are shown to conform to accepted scheduling frameworks without the evolutionary process being explicitly told the form of the desired solution...
March 12, 2018: Evolutionary Computation
https://www.readbyqxmd.com/read/29466026/opposition-based-memetic-algorithm-and-hybrid-approach-for-sorting-permutations-by-reversals
#14
José Luis Soncco-Álvarez, Daniel M Muñoz, Mauricio Ayala-Rincón
Sorting unsigned permutations by reversals is a difficult problem; indeed, it was proved to be NP-hard by Caprara (1997). Because of its high complexity, many approximation algorithms to compute the minimal reversal distance were proposed until reaching the nowadays best-known theoretical ratio of 1.375. In this article, two memetic algorithms to compute the reversal distance are proposed. The first one uses the technique of opposition-based learning leading to an opposition-based memetic algorithm; the second one improves the previous algorithm by applying the heuristic of two breakpoint elimination leading to a hybrid approach...
February 21, 2018: Evolutionary Computation
https://www.readbyqxmd.com/read/29446983/multi-objectivising-combinatorial-optimisation-problems-by-means-of-elementary-landscape-decompositions
#15
Josu Ceberio, Borja Calvo, Alexander Mendiburu, Jose A Lozano
In the last decade, many works in combinatorial optimisation have shown that, due to the advances in multi-objective optimisation, the algorithms from this field could be used for solving single-objective problems as well. In this sense, a number of papers have proposed multi-objectivising single-objective problems in order to use multi-objective algorithms in their optimisation. In this article, we follow up this idea by presenting a methodology for multi-objectivising combinatorial optimisation problems based on elementary landscape decompositions of their objective function...
February 15, 2018: Evolutionary Computation
https://www.readbyqxmd.com/read/28632396/probabilistic-analysis-of-the-1-1-evolutionary-algorithm
#16
Hsien-Kuei Hwang, Alois Panholzer, Nicolas Rolin, Tsung-Hsi Tsai, Wei-Mei Chen
We give a detailed analysis of the optimization time of the [Formula: see text]-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...
2018: Evolutionary Computation
https://www.readbyqxmd.com/read/28489414/on-proportions-of-fit-individuals-in-population-of-mutation-based-evolutionary-algorithm-with-tournament-selection
#17
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...
2018: Evolutionary Computation
https://www.readbyqxmd.com/read/28358647/co-optimization-free-lunches-tractability-of-optimal-black-box-algorithms-for-maximizing-expected-utility
#18
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...
2018: Evolutionary Computation
https://www.readbyqxmd.com/read/28323435/quantifying-selection-pressure
#19
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...
2018: Evolutionary Computation
https://www.readbyqxmd.com/read/28207296/gambit-a-parameterless-model-based-evolutionary-algorithm-for-mixed-integer-problems
#20
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 article, discrete and continuous model-building mechanisms are integrated for the Mixed-Integer (MI) domain, comprising discrete and continuous variables...
2018: 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"