Exact solution of the soft-clustered vehicle-routing problem.
Timo HintschStefan IrnichPublished in: Eur. J. Oper. Res. (2020)
Keyphrases
- exact solution
- vehicle routing problem
- vehicle routing
- metaheuristic
- lower bound
- exact algorithms
- routing problem
- column generation
- tabu search
- np hard
- test instances
- benchmark instances
- traveling salesman problem
- vehicle routing problem with time windows
- benchmark problems
- travel time
- combinatorial optimization
- optimal solution
- memetic algorithm
- approximate solutions
- combinatorial optimization problems
- hybrid metaheuristic
- multi depot
- iterated local search
- particle swarm optimization
- knapsack problem
- search strategies
- logistics distribution
- upper bound
- vehicle routing problem with simultaneous
- pick up and delivery
- linear programming
- special case
- variable neighborhood search
- scheduling problem
- simulated annealing
- information retrieval systems
- optimization problems
- greedy randomized adaptive search procedure
- branch and bound