An iterated local search heuristic for the split delivery vehicle routing problem.
Marcos Melo SilvaAnand SubramanianLuiz Satoru OchiPublished in: Comput. Oper. Res. (2015)
Keyphrases
- iterated local search
- vehicle routing problem
- vehicle routing problem with simultaneous
- tabu search
- metaheuristic
- vehicle routing problem with time windows
- benchmark problems
- multi depot
- benchmark instances
- combinatorial optimization
- routing problem
- multi start
- simulated annealing
- traveling salesman problem
- memetic algorithm
- hybrid metaheuristic
- travel time
- np hard
- particle swarm optimization
- heuristic methods
- variable neighborhood search
- neural network
- search procedure
- pick up and delivery
- ant colony optimization
- feasible solution
- combinatorial optimization problems
- solution space
- knapsack problem
- search strategies
- search methods
- special case
- search algorithm
- genetic algorithm
- combinatorial problems
- search procedures
- path relinking
- branch and bound
- scheduling problem
- multi objective
- optimal solution