Evolutionary optimization: pitfalls and booby traps
DOI10.1007/S11390-012-1274-4zbMATH Open1279.68281OpenAlexW2163286715MaRDI QIDQ389022FDOQ389022
Authors: Thomas Weise, Raymond Chiong, Ke Tang 
Publication date: 17 January 2014
Published in: Journal of Computer Science and Technology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11390-012-1274-4
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
- Title not available (Why is that?)
- Introduction to evolutionary computing
- Title not available (Why is that?)
- Multi-objective optimization using evolutionary algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Gentle Introduction to Memetic Algorithms
- Greedy randomized adaptive search procedures
- Tabu Search—Part II
- Title not available (Why is that?)
- Title not available (Why is that?)
- Helper-objectives: Using multi-objective evolutionary algorithms for single-objective optimisation
- Evolutionary Multi-Criterion Optimization
- Evolutionary computation in dynamic and uncertain environments.
- Simulated annealing: Practice versus theory
- Representations for genetic and evolutionary algorithms. With a foreword by David E. Goldberg.
- Neutrality in fitness landscapes.
- Learning and intelligent optimization. 5th international conference, LION 5, Rome, Italy, January 17--21, 2011. Selected papers
- The algebra of genetic algorithms
- Statistical Dynamics of the Royal Road Genetic Algorithm
- A note on the finite time behavior of simulated annealing.
- Burden and benefits of redundancy
- Title not available (Why is that?)
- Title not available (Why is that?)
- A large population size can be unhelpful in evolutionary algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the impact of the mutation-selection balance on the runtime of evolutionary algorithms
- Optimizing epochal evolutionary search: Population-size dependent theory
- Towards an analytic framework for analysing the computation time of evolutionary algorithms
- Choosing selection pressure for wide-gap problems
- Continuous lunches are free plus the design of optimal optimization algorithms
- Particle swarm optimization for function optimization in noisy environment
- Large scale evolutionary optimization using cooperative coevolution
Cited In (5)
- Reservoirs learn to learn
- Global versus local search: the impact of population sizes on evolutionary algorithm performance
- An ensemble algorithm with self-adaptive learning techniques for high-dimensional numerical optimization
- A set of new multi- and many-objective test problems for continuous optimization and a comprehensive experimental evaluation
- Altruistic population algorithm: a metaheuristic search algorithm for solving multimodal multi-objective optimization problems
Uses Software
This page was built for publication: Evolutionary optimization: pitfalls and booby traps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q389022)
