New Families of Valid Inequalities for the Two-Echelon Vehicle Routing Problem.
Guido PerboliRoberto TadeiPublished in: Electron. Notes Discret. Math. (2010)
Keyphrases
- vehicle routing problem
- families of valid inequalities
- lower bound
- integer programming
- tabu search
- metaheuristic
- np hard
- routing problem
- supply chain
- benchmark problems
- vehicle routing problem with time windows
- vehicle routing
- test instances
- traveling salesman problem
- hybrid metaheuristic
- travel time
- combinatorial optimization
- benchmark instances
- particle swarm optimization
- lead time
- logistics distribution
- memetic algorithm
- simulated annealing
- multi depot
- upper bound
- pick up and delivery
- special case
- search strategies
- knapsack problem
- iterated local search
- scatter search
- vehicle routing problem with simultaneous
- branch and bound
- multi objective