Solving the mobile mapping van problem: A hybrid metaheuristic for capacitated arc routing with soft time windows.
Pieter VansteenwegenWouter SouffriauKenneth SörensenPublished in: Comput. Oper. Res. (2010)
Keyphrases
- vehicle routing problem
- hybrid metaheuristic
- routing problem
- combinatorial optimization
- vehicle routing
- metaheuristic
- tabu search
- benchmark problems
- traveling salesman problem
- scatter search
- travel time
- benchmark instances
- memetic algorithm
- np hard
- variable neighborhood search
- network flow problem
- particle swarm optimization
- optimization problems
- search strategies
- knapsack problem
- shortest path
- simulated annealing
- hybrid algorithm
- genetic algorithm
- branch and bound
- scheduling problem
- search algorithm