New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows.
Roberto BaldacciAristide MingozziRoberto RobertiPublished in: INFORMS J. Comput. (2012)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- state space
- discrete optimization problems
- vehicle routing problem
- optimization problems
- traveling salesman
- combinatorial optimization problems
- ant colony optimization
- heuristic search
- markov decision problems
- combinatorial problems
- branch and bound
- ant colony optimization algorithm
- branch and bound algorithm
- reinforcement learning
- metaheuristic
- simulated annealing
- markov decision processes
- linear programming
- crossover operator
- valid inequalities
- search algorithm
- discrete particle swarm optimization
- lower bound
- search space
- neural network
- genetic local search
- hamiltonian cycle
- quadratic assignment problem
- genetic algorithm