The vehicle routing problem with hard time windows and stochastic service times.
Fausto ErricoGuy DesaulniersMichel GendreauWalter ReiLouis-Martin RousseauPublished in: EURO J. Transp. Logist. (2018)
Keyphrases
- vehicle routing problem
- service times
- steady state
- state dependent
- vehicle routing
- metaheuristic
- routing problem
- tabu search
- stationary distribution
- queue length
- queueing model
- benchmark problems
- traveling salesman problem
- hybrid metaheuristic
- vehicle routing problem with time windows
- processor sharing
- processor sharing queue
- arrival process
- travel time
- single server queue
- single server
- np hard
- fluid model
- arrival rate
- random variables
- independent and identically distributed
- combinatorial optimization
- particle swarm optimization
- queueing networks
- knapsack problem
- vehicle routing problem with simultaneous
- call center
- search strategies
- optimization problems
- simulated annealing
- markov chain
- search methods
- search algorithm
- neural network