Branch-and-Price-and-Cut for the Periodic Vehicle Routing Problem with Flexible Schedule Structures.
Ann-Kathrin RothenbächerPublished in: Transp. Sci. (2019)
Keyphrases
- vehicle routing problem
- metaheuristic
- tabu search
- vehicle routing
- routing problem
- vehicle routing problem with time windows
- scheduling problem
- benchmark problems
- traveling salesman problem
- multi depot
- memetic algorithm
- hybrid metaheuristic
- travel time
- np hard
- benchmark instances
- particle swarm optimization
- variable neighborhood search
- iterated local search
- logistics distribution
- test instances
- greedy randomized adaptive search procedure
- knapsack problem
- combinatorial optimization
- optimization problems
- integer programming
- approximation algorithms
- search strategies
- linear programming
- multi objective