Examining the effects of construction heuristics and problem structure on solution quality of the vehicle routing problem with split deliveries and time windows.
Marcus E. McNabbJeffery D. WeirShane N. HallPublished in: Int. J. Metaheuristics (2017)
Keyphrases
- vehicle routing problem
- test instances
- benchmark instances
- solution quality
- tabu search algorithm
- tabu search
- metaheuristic
- simulated annealing
- benchmark problems
- routing problem
- test problems
- vehicle routing problem with time windows
- vehicle routing
- combinatorial optimization
- optimal solution
- travel time
- computational efficiency
- traveling salesman problem
- hybrid metaheuristic
- memetic algorithm
- heuristic methods
- np hard
- grasp with path relinking
- feasible solution
- search strategies
- combinatorial optimization problems
- particle swarm optimization
- pick up and delivery
- path relinking
- neighborhood search
- vehicle routing problem with simultaneous
- iterated local search
- ant colony optimization
- scatter search
- knapsack problem
- branch and bound
- heuristic search
- scheduling problem
- evolutionary algorithm
- search space
- search algorithm