A short note on applying a simple LS/LNS-based metaheuristic to the rollon-rolloff vehicle routing problem.
Ulrich DerigsMarkus PullmannUlrich VogelPublished in: Comput. Oper. Res. (2013)
Keyphrases
- vehicle routing problem
- metaheuristic
- tabu search
- combinatorial optimization
- hybrid metaheuristic
- simulated annealing
- ant colony optimization
- test instances
- routing problem
- vehicle routing problem with time windows
- optimization problems
- scatter search
- iterated local search
- combinatorial optimization problems
- benchmark problems
- greedy randomized adaptive search procedure
- search space
- benchmark instances
- traveling salesman problem
- particle swarm optimization
- memetic algorithm
- travel time
- path relinking
- variable neighborhood search
- genetic algorithm
- search methods
- optimal solution
- np hard
- objective function
- neural network
- feasible solution
- multi objective
- nature inspired