A Feasibility-Preserving Crossover and Mutation Operator for Constrained Combinatorial Problems.
Martin LukasiewyczMichael GlaßJürgen TeichPublished in: PPSN (2008)
Keyphrases
- combinatorial problems
- crossover and mutation
- constraint programming
- genetic algorithm
- metaheuristic
- genetic operators
- traveling salesman problem
- multi objective optimization
- combinatorial optimization
- fitness function
- constraint satisfaction problems
- constraint satisfaction
- phase transition
- genetic algorithm ga
- branch and bound algorithm
- crossover operator
- genetic search
- mutation operator
- global constraints
- premature convergence
- evolutionary algorithm
- simulated annealing
- tabu search
- combinatorial optimization problems
- multi objective
- initial population
- ant colony optimization
- constraint propagation
- convergence rate
- genetic programming
- evolutionary computation
- search algorithm