Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs.
Roberto BaldacciMaria BattarraDaniele VigoPublished in: Networks (2009)
Keyphrases
- vehicle routing problem
- valid inequalities
- traveling salesman problem
- vehicle routing problem with time windows
- mixed integer linear programs
- mixed integer programming
- fixed cost
- metaheuristic
- tabu search
- routing problem
- vehicle routing
- feasible solution
- combinatorial optimization
- benchmark problems
- mixed integer
- travel time
- np hard
- knapsack problem
- cutting plane
- lot sizing
- particle swarm optimization
- linear programming
- integer programming
- infinite horizon
- mathematical model
- optimization problems
- column generation
- lower and upper bounds
- search strategies
- training set