Testing local search move operators on the vehicle routing problem with split deliveries and time windows.
Marcus E. McNabbJeffery D. WeirRaymond R. HillShane N. HallPublished in: Comput. Oper. Res. (2015)
Keyphrases
- vehicle routing problem
- tabu search
- memetic algorithm
- iterated local search
- combinatorial optimization
- neighborhood search
- metaheuristic
- greedy randomized adaptive search procedure
- vehicle routing
- vehicle routing problem with time windows
- simulated annealing
- traveling salesman problem
- routing problem
- travel time
- test instances
- benchmark problems
- benchmark instances
- genetic algorithm
- vehicle routing problem with simultaneous
- search strategies
- search algorithm
- particle swarm optimization
- job shop scheduling problem
- multi start
- np hard
- search space
- optimal solution
- scheduling problem
- hybrid metaheuristic
- hybrid algorithm
- heuristic methods
- optimization problems
- knapsack problem
- path relinking
- variable neighborhood search
- optimization algorithm
- search procedure
- logistics distribution
- multi depot
- lower bound
- branch and bound
- information retrieval