Comparing Two Constraint Handling Techniques in a Binary-Coded Genetic Algorithm for Optimization Problems.
Helio J. C. BarbosaAfonso C. C. LemongeLeonardo Goliatt da FonsecaHeder S. BernardinoPublished in: SEAL (2010)
Keyphrases
- constraint handling
- optimization problems
- constrained optimization problems
- genetic algorithm
- evolutionary algorithm
- metaheuristic
- constrained optimization
- particle swarm optimization
- penalty function
- evolution strategy
- objective function
- optimization methods
- differential evolution
- fitness function
- knapsack problem
- benchmark problems
- evolutionary optimization
- multi objective
- evolutionary computation
- cost function
- genetic programming
- test problems
- multi objective optimization
- ant colony optimization
- simulated annealing
- optimization method
- nsga ii
- combinatorial optimization
- job shop scheduling problem
- tabu search
- optimal design
- traveling salesman problem
- multi objective genetic algorithm
- neural network
- genetic operators
- particle swarm optimization pso
- artificial intelligence
- global convergence
- crossover operator
- hybrid algorithm
- particle swarm optimization algorithm
- convergence speed