A set-covering based heuristic algorithm for the periodic vehicle routing problem.
Valentina CacchianiVera C. HemmelmayrFabien TricoirePublished in: Discret. Appl. Math. (2014)
Keyphrases
- vehicle routing problem
- set covering
- set covering problem
- metaheuristic
- tabu search
- integer programming
- vehicle routing
- np hard
- test instances
- routing problem
- traveling salesman problem
- travel time
- hybrid metaheuristic
- vehicle routing problem with time windows
- benchmark problems
- combinatorial optimization
- column generation
- knapsack problem
- particle swarm optimization
- mathematical programming
- combinatorial optimization problems
- memetic algorithm
- simulated annealing
- multi depot
- hypergraph model
- combinatorial auctions
- path relinking
- genetic algorithm
- variable neighborhood search
- scatter search
- test problems
- dynamic programming
- special case