State-space relaxation procedures for the computation of bounds to routing problems.
Nicos ChristofidesAristide MingozziPaolo TothPublished in: Networks (1981)
Keyphrases
- routing problem
- state space
- search procedures
- lower bound
- heuristic search
- vehicle routing
- optimal policy
- markovian decision
- vehicle routing problem
- dynamic programming
- markov decision processes
- reinforcement learning
- depth first search
- vehicle routing problem with time windows
- shortest path
- lower and upper bounds
- upper bound
- traveling salesman problem
- learning algorithm
- genetic algorithm
- neural network