Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery.
Dimitrios G. PandelisC. C. KaramatsoukisE. G. KyriakidisPublished in: Eur. J. Oper. Res. (2013)
Keyphrases
- infinite horizon
- vehicle routing problem
- holding cost
- finite horizon
- optimal control
- vehicle routing problem with time windows
- optimal policy
- long run
- stochastic demand
- markov decision processes
- metaheuristic
- production planning
- partially observable
- single item
- dynamic programming
- routing problem
- average cost
- tabu search
- markov decision process
- vehicle routing
- neural network
- lead time
- inventory level
- traveling salesman problem
- total cost
- knapsack problem