A multi-start local search heuristic for the Green Vehicle Routing Problem based on a multigraph reformulation.
Juho AndelminEnrico BartoliniPublished in: Comput. Oper. Res. (2019)
Keyphrases
- multi start
- vehicle routing problem
- tabu search
- iterated local search
- vehicle routing problem with time windows
- metaheuristic
- simulated annealing
- path relinking
- memetic algorithm
- benchmark instances
- variable neighborhood descent
- global optimization
- routing problem
- combinatorial optimization
- feasible solution
- benchmark problems
- heuristic methods
- neighborhood search
- search procedure
- test problems
- variable neighborhood search
- scheduling problem
- travel time
- hybrid metaheuristic
- optimal solution
- stochastic approximation
- greedy randomized adaptive search procedure
- job shop scheduling problem
- scatter search
- search space
- combinatorial optimization problems
- np hard
- search algorithm
- genetic algorithm
- solution space
- traveling salesman problem
- search strategies
- monte carlo
- dynamic programming
- neural network