Fast Evolutionary Programming
Explore this paper's citation graph
Summary
This paper proposes a fast EP (FEP) which uses a Cauchy instead of Gaussian mutation operator as the primary search operator and shows that FEP performs much better than CEP for multi-modal functions with many local minima while being comparable to CEP in performance for unimodal and multi- modal function optimisation problems with only a fewLocal minima.
- Type
- article
- Published
- 1996-01-01
- Cited by
- 343
- References
- 13
- OpenAlex
- https://openalex.org/W177635913
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:14808044
Keywords
Computer science, Evolutionary programming, Genetic programming, Artificial intelligence, Evolutionary algorithm
References
- Evolving artificial intelligence
- No Free Lunch Theorems for Search
- Nonconvex optimization by fast simulated annealing
- An Overview of Evolutionary Algorithms for Parameter Optimization
- Simulated annealing with extended neighbourhood
- System Identification Through Simulated Evolution: A Machine Learning Approach to Modeling
- A new simulated annealing algorithm
- Applying evolutionary programming to selected traveling salesman problems
- Evolution and optimum seeking
- Improving Monte Carlo Efficiency by Increasing Variance
- An introduction to simulated evolutionary optimization
- An Introduction to Probability Theory and Its Applications
- An introduction to probability theory and its applications
- Artificial Intelligence through Simulated Evolution
Cited by
- Function optimization using differential evolution without explicit parameter tuning
- An algorithm for evolving protocol constraints
- Randomized Search Methods for Solving Markov Decision Processes and Global Optimization
- An Overview of Parameter Control Methods by Self-Adaptation in Evolutionary Algorithms
- An introduction to evolutionary design by computers
- Comparison and Analysis of Mutation-based Evolutionary Algorithms for ANN Parameters Optimization
- An adaptive mutation operator for particle swarm optimization
- A Modified Cultural Algorithm based on Genetic Algorithm for Solving Global Optimization Problems
- Self-adaptation in evolution strategies
- Data clustering optimization with visualization
- Fast immunized evolutionary programming
- Blind channel identification using evolutionary programming
- Learning stable mutation in (1, lambda)ES evolutionary strategy
- Adapting Self-Adaptive Parameters in Evolutionary Algorithms
- Phenotypic evolution with a mutation based on symmetric α-stable distributions
- Gaussian particle swarm with jumps
- Evolving variability tolerant logic
- PSO embedded evolutionary programming technique for nonconvex economic load dispatch
- Properties of Quantum Particles in Multi-Swarms for Dynamic Optimization
- Evolutionary Algorithms for Solving Multi-Objective Problems
Related papers
- Artificial Intelligence through Simulated Evolution
- An Overview of Evolutionary Algorithms for Parameter Optimization
- Evolutionary programming made faster
- Evolutionary Computation: Towards a New Philosophy of Machine Intelligence
- Particle swarm optimization
- Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence
- Combining mutation operators in evolutionary programming
- No free lunch theorems for optimization
- Evolution and optimum seeking