Evolutionary estimation of assignment-ordering function for CSP-modeled combinatorial optimization.
Adnan AcanAhmet ÜnverenYüce TekolPublished in: IEEE Congress on Evolutionary Computation (2003)
Keyphrases
- combinatorial optimization
- traveling salesman problem
- metaheuristic
- combinatorial problems
- branch and bound
- simulated annealing
- combinatorial optimization problems
- branch and bound algorithm
- genetic algorithm
- estimation of distribution algorithms
- hard combinatorial optimization problems
- optimization problems
- mathematical programming
- constraint satisfaction problems
- tabu search
- quadratic assignment problem
- vehicle routing problem
- constraint propagation
- multi valued
- evolutionary algorithm
- combinatorial search
- path relinking
- exact algorithms
- evolutionary computation
- neural network
- memetic algorithm
- multi objective
- np hard
- genetic programming
- constraint satisfaction
- max flow min cut