A feasibility-preserving local search operator for constrained discrete optimization problems.
Martin LukasiewyczMichael GlaßChristian HaubeltJürgen TeichPublished in: IEEE Congress on Evolutionary Computation (2008)
Keyphrases
- discrete optimization problems
- traveling salesman problem
- discrete optimization
- optimization problems
- combinatorial optimization
- decision problems
- search algorithm
- search space
- combinatorial optimization problems
- hard constraints
- optimal solution
- artificial intelligence
- selection operator
- genetic algorithm
- dynamic programming
- tabu search
- swarm intelligence
- branch and bound method
- computational intelligence
- neural network
- branch and bound