An experimental comparison of two constraint handling approaches used with differential evolution
| Autor: | Saku Kukkonen, Efren Mezura-Montes |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Concurrent constraint logic programming
0209 industrial biotechnology Mathematical optimization Hybrid algorithm (constraint satisfaction) 02 engineering and technology Binary constraint Constraint satisfaction Constraint (information theory) 020901 industrial engineering & automation Constraint graph Constraint logic programming 0202 electrical engineering electronic engineering information engineering Constraint programming 020201 artificial intelligence & image processing Algorithm Mathematics |
| Zdroj: | CEC |
| DOI: | 10.1109/cec.2017.7969634 |
| Popis: | In this paper, two existing constraint handling approaches are compared. The constraint handling approaches are based on the same principle of preferring feasible solution candidates over infeasible but they differ in the case of two infeasible solution candidates. One approach calculates the sum of constraint violations, whereas the other approach uses Pareto-dominance of constraint violations. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|