Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier.
Dominik GoekeTimo GschwindMichael SchneiderPublished in: Discret. Appl. Math. (2019)
Keyphrases
- vehicle routing problem
- upper and lower bounds
- upper bound
- lower bound
- metaheuristic
- tabu search
- routing problem
- np hard
- vehicle routing
- benchmark problems
- vehicle routing problem with time windows
- traveling salesman problem
- travel time
- hybrid metaheuristic
- lower and upper bounds
- logistics distribution
- sample complexity
- multi depot
- knapsack problem
- combinatorial optimization
- simulated annealing
- dynamic programming
- genetic algorithm
- pick up and delivery
- vehicle routing problem with simultaneous
- sample size
- particle swarm optimization
- support vector