Related Experiment Video
Updated: Mar 19, 2026

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
Published on: December 9, 2012
A Guiding Evolutionary Algorithm with Greedy Strategy for Global Optimization Problems
Leilei Cao1, Lihong Xu2, Erik D Goodman3
1Department of Control Science and Engineering, Tongji University, Shanghai 201804, China; BEACON Center for the Study of Evolution in Action, Michigan State University, East Lansing, MI 48824, USA.
Abstract:
A Guiding Evolutionary Algorithm (GEA) with greedy strategy for global optimization problems is proposed. Inspired by Particle Swarm Optimization, the Genetic Algorithm, and the Bat Algorithm, the GEA was designed to retain some advantages of each method while avoiding some disadvantages. In contrast to the usual Genetic Algorithm, each individual in GEA is crossed with the current global best one instead of a randomly selected individual. The current best individual served as a guide to attract offspring to its region of genotype space. Mutation was added to offspring according to a dynamic mutation probability. To increase the capability of exploitation, a local search mechanism was applied to new individuals according to a dynamic probability of local search. Experimental results show that GEA outperformed the other three typical global optimization algorithms with which it was compared.
Related Concept Videos
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Optimal Foraging
Optimization Problems
Limits to Natural Selection
Gene Evolution - Fast or Slow?
Gene Evolution - Fast or Slow?
In contrast, regions which code...
