Updates:
Summary: Constraint handling - assessing feasibility
Status: Started
Comment #2 on issue 28 by felix.antoine.fortin: Constraint handling -
assessing feasibility
http://code.google.com/p/deap/issues/detail?id=28
Some more food for thoughts, Coello Coello (2002) has written a survey on
constraint-handling techniques used in evolutionary algorithms.
He lists 5 major approaches.
- Penalty functions (i.e., static, dynamic, annealing, adaptive,
co-evolutionary, and death penalties)
- Special representations and operators (preserving feasibility at all
times and decoders and transforming the shape of the search space)
- Repair algorithms (make valid (or feasible) individuals through the
application of a certain heuristic)
- Separation of objectives and constraints (i.e.: usage of multiobjective
optimization techniques)
- Hybrid methods (Lagrangian multipliers, fuzzy logic, the use of cultural
algorithms or the immune system)
While some of the approaches might never be implemented in the core, it
could be appropriate to write a tutorial on constraint-handling which
covers the basics of each approach and how to implement them in DEAP.
--
Coelle Coello, C. A. "Theoretical and numerical constraint-handling
techniques used with evolutionary algorithms: a survey of the state of the
art". Computer Methods in Applied Mechanics and Engineering 191, 11-12,
1245-1287, 2002.
--
You received this message because this project is configured to send all
issue notifications to this address.
You may adjust your notification preferences at:
https://code.google.com/hosting/settings