Evolutionary computation. 1. Basic algorithms and operators
Collections of articles of miscellaneous specific interest (00B15) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science (68-00) Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59)
The book Evolutionary Computation 1: Basic Algorithms and Operators is the first of two volumes based in the original handbook of evolutionary computation edited by the same authors (1997; Zbl 0883.68001). This new volume contains extended material and provides basic information on evolutionary algorithms. The idea of evolutionary computation has been to make use of the powerful process of natural evolution as a problem solving paradigms by simulating it in a laboratory or on a computer. The first ideas and mainstream methods were developed in the 1950s and 1960s. The progress in the theory since 1990 confirms the strengths of the studied algorithms as well as their limitations. This book provides an interesting reference for theorists, teachers, and practitioners also. It covers the paradigms of evolutionary computation and its biological background. It contains the following parts (34 chapters):NEWLINENEWLINENEWLINEPart 1: Why Evolutionary Computation? (Introduction, applications, advantages and disadvantages of evolutionary computation over other approaches), Part 2: Evolutionary Computation: The Background (Principles and history), Part 3: Evolutionary Algorithms and their Standard Instances (General outline of evolutionary algorithms, genetic algorithms, evolution strategies, evolutionary programming and genetic programming, learning, and hybrid methods), Part 4: Representations (for instance binary strings, real-valued vectors, finite-state representations, and parse trees), Part 5: Selection (among others tournament selection, rank-based selection, Boltzmann Selection, and generation gap methods), Part 6: Search Operators (mutation operators, recombination, and other operators).NEWLINENEWLINENEWLINESeveral interesting references are given by the 24 authors at the end of each of the 34 chapters.
- Memetic algorithm timetabling for non-commercial sport leagues.
- Robustness of linkage strategy that leads to large-scale cooperation
- The algorithm for algorithms: an evolutionary algorithm based on automatic designing of genetic operators
- The use of frontier techniques to identify efficient solutions for the berth allocation problem solved with a hybrid evolutionary algorithm
- Cellular automata based S-boxes
- Genetically optimized logic models
- Adaptive business intelligence based on evolution strategies: Some application examples of self-adaptive software.
- GA performance distributions and randomly generated binary constraint satisfaction problems.
- A genetic algorithm for a global optimization problem arising in the detection of gravitational waves
- The importance of subjectivity in perceptual errors on the emergence of indirect reciprocity
- Exact computation of the expectation surfaces for uniform crossover along with bit-flip mutation
- Backward-chaining evolutionary algorithms
- Observations in using parallel and sequential evolutionary algorithms for automatic software testing
- Hybrid metaheuristics for the vehicle routing problem with stochastic demands
- Evolutionary computation. 2. Advanced algorithms and operators
- Artificial intelligence evolved from random behaviour: departure from the state of the art
- Truncation selection and payoff distributions applied to the replicator equation
- Towards the super-massive black hole seeds
- Energy-oriented scheduling based on evolutionary algorithms
- An Agent Based Approach to the Selection Dilemma in CBR
- A novel global optimization technique for high dimensional functions
- Sistema imunológico artificial para resolver o problema da árvore geradora mínima com parâmetros fuzzy
- A theoretical and empirical study on unbiased boundary-extended crossover for real-valued representation
- scientific article; zbMATH DE number 1179499 (Why is no real title available?)
- A survey of repair methods used as constraint handling techniques in evolutionary algorithms
- Geometricity of genetic operators for real-coded representation
- Metaheuristic approaches for the berth allocation problem
- Time series adjustment enhancement of hierarchical modeling of \textit{Arabidopsis thaliana} gene interactions
- The “One-fifth Rule” with Rollbacks for Self-Adjustment of the Population Size in the (1 + (λ,λ)) Genetic Algorithm
- Stochastic consensus dynamics for nonconvex optimization on the Stiefel manifold: mean-field limit and convergence
- A new selection operator for genetic algorithms that balances between premature convergence and population diversity
- Fitness landscape analysis for the no-wait flow-shop scheduling problem
- The island model as a Markov dynamic system
- Analytical and numerical comparisons of biogeography-based optimization and genetic algorithms
- scientific article; zbMATH DE number 960162 (Why is no real title available?)
- Comparative analysis of machine learning methods for active flow control
- Introduction to evolutionary computing
- Exposing the grey wolf, moth‐flame, whale, firefly, bat, and antlion algorithms: six misleading optimization techniques inspired by bestial metaphors
- Recursive linear models optimized by bioinspired metaheuristics to streamflow time series prediction
- To improve the performance of genetic algorithms by using a novel selection operator
- Practical performance models of algorithms in evolutionary program induction and other domains
- Optimization of a pumping ship trajectory to clean oil contamination in the open sea
- Discrete cooperative coverage location models with alternative facility types in a probabilistic setting
- A parallel ``Go with the winners algorithm for some scheduling problems
- Stability-driven assembly theory
- Simultaneous detection of structural breaks and outliers in time series
- Enhancing symbolic regression with side information for data analysis
- Computing the metric dimension of graphs by genetic algorithms
- Searching for multiobjective preventive maintenance schedules: combining preferences with evolutionary algorithms
- Evolutionary hybrid approaches for generation scheduling in power systems
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
- Can abstract state machines be useful in language theory?
This page was built for publication: Evolutionary computation. 1. Basic algorithms and operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2709288)
