Constraint-Handling Techniques
暂无分享,去创建一个
Every real-world problem poses constraints. You can’t get away from them. It’s only the textbooks that allow you to solve problems in the absence of constraints. Dhar and Ranganathan [102] wrote:
Virtually all decision making situations involve constraints. What distinguishes various types of problems is the form of these constraints. Depending on how the problem is visualized, they can arise as rules, data dependencies, algebraic expressions, or other forms.
We would only amend this by removing the word “virtually.” In the most extreme case, if a real-world problem is worth solving, then it is worth solving within your lifetime, or at least the foreseeable life span of the human race. The eventual nova of our sun puts a constraint on everything, and a very final one at that.
[1] Xin Yao,et al. Stochastic ranking for constrained evolutionary optimization , 2000, IEEE Trans. Evol. Comput..
[2] K. Deb. An Efficient Constraint Handling Method for Genetic Algorithms , 2000 .
[3] Zbigniew Michalewicz,et al. Evolutionary Algorithms, Homomorphous Mappings, and Constrained Parameter Optimization , 1999, Evolutionary Computation.
[4] Carlos A. Coello Coello,et al. Use of a self-adaptive penalty approach for engineering optimization problems , 2000 .