Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness.
Olaf MersmannBernd BischlJakob BossekHeike TrautmannMarkus WagnerFrank NeumannPublished in: LION (2012)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- neighborhood search
- lin kernighan
- ant colony optimization
- combinatorial problems
- traveling salesman
- hamiltonian cycle
- combinatorial optimization problems
- optimization problems
- memetic algorithm
- aco algorithm
- crossover operator
- phase transition
- metaheuristic
- computational complexity
- search algorithm
- ant colony optimization algorithm
- branch and bound algorithm
- simulated annealing
- vehicle routing problem
- tabu search
- nature inspired
- variable neighborhood search
- valid inequalities
- path relinking
- genetic local search
- search space
- optimal solution
- job shop scheduling problem
- np complete
- np hard
- genetic algorithm
- branch and bound
- discrete optimization problems
- hill climbing
- swarm intelligence
- information theoretic
- heuristic search
- dynamic programming
- discrete particle swarm optimization