Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints.
Aristide MingozziLucio BiancoSalvatore RicciardelliPublished in: Oper. Res. (1997)
Keyphrases
- traveling salesman problem
- precedence constraints
- dynamic programming
- branch and bound algorithm
- combinatorial optimization
- scheduling problem
- single machine
- ant colony optimization
- single machine scheduling problem
- lagrangian relaxation
- parallel machines
- approximation algorithms
- traveling salesman
- crossover operator
- vehicle routing problem
- optimization problems
- branch and bound
- global constraints
- genetic local search
- state space
- np hard
- lower bound
- hamiltonian cycle
- objective function
- reinforcement learning
- stereo matching
- markov decision processes
- tabu search
- metaheuristic
- linear programming
- valid inequalities
- evolutionary algorithm