Local search based metaheuristics for the robust vehicle routing problem with discrete scenarios.
Elyn L. Solano-CharrisChristian PrinsAndréa Cynthia SantosPublished in: Appl. Soft Comput. (2015)
Keyphrases
- vehicle routing problem
- tabu search
- metaheuristic
- memetic algorithm
- iterated local search
- combinatorial optimization
- greedy randomized adaptive search procedure
- neighborhood search
- hybrid metaheuristic
- vehicle routing problem with time windows
- simulated annealing
- routing problem
- benchmark instances
- traveling salesman problem
- vehicle routing
- benchmark problems
- test instances
- path relinking
- travel time
- search space
- particle swarm optimization
- np hard
- search strategies
- multi depot
- genetic algorithm
- multi start
- search algorithm
- combinatorial optimization problems
- scheduling problem
- search procedure
- logistics distribution
- guided local search
- scatter search
- hybrid algorithm
- optimal solution
- heuristic methods
- optimization problems
- pick up and delivery
- job shop scheduling problem
- knapsack problem