A branch-and-price based heuristic for the stochastic vehicle routing problem with hard time windows.
Giovanni AndreattaM. CasulaCarla De FrancescoLuigi De GiovanniPublished in: Electron. Notes Discret. Math. (2016)
Keyphrases
- vehicle routing problem
- tabu search
- benchmark instances
- multi depot
- tree search algorithm
- test instances
- combinatorial optimization
- iterated local search
- vehicle routing
- metaheuristic
- variable neighborhood search
- routing problem
- search strategies
- vehicle routing problem with time windows
- benchmark problems
- simulated annealing
- neighborhood search
- travel time
- hybrid metaheuristic
- feasible solution
- memetic algorithm
- greedy randomized adaptive search procedure
- traveling salesman problem
- search algorithm
- heuristic methods
- search strategy
- logistics distribution
- neural network
- search procedure
- genetic algorithm
- pick up and delivery
- reinforcement learning
- multi start
- special case
- job shop scheduling problem
- np hard
- optimal solution
- scheduling problem
- upper bound
- optimization problems
- particle swarm optimization