Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees.
Marshall L. FisherPublished in: Oper. Res. (1994)
Keyphrases
- vehicle routing problem
- optimal solution
- metaheuristic
- np hard
- vehicle routing problem with time windows
- tabu search
- test instances
- knapsack problem
- routing problem
- solution quality
- benchmark instances
- minimum cost
- greedy randomized adaptive search procedure
- feasible solution
- traveling salesman problem
- guided local search
- simulated annealing
- decision trees
- linear programming
- combinatorial optimization
- memetic algorithm
- benchmark problems
- solution space
- multi depot
- variable neighborhood search
- search space
- objective function
- column generation
- waste collection
- heuristic methods
- particle swarm optimization
- np complete
- optimization problems
- ant colony optimization
- branch and bound algorithm
- linear program
- exact algorithms
- scatter search
- neighborhood search
- integer programming
- approximation algorithms
- scheduling problem
- search methods
- branch and bound
- neural network
- path relinking
- lower bound
- special case
- test problems