Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem.
Hande YamanPublished in: Math. Program. (2006)
Keyphrases
- valid inequalities
- vehicle routing problem
- traveling salesman problem
- vehicle routing problem with time windows
- combinatorial optimization
- mixed integer linear programs
- routing problem
- integer programming
- cutting plane algorithm
- feasible solution
- tabu search
- test instances
- metaheuristic
- network design problem
- vehicle routing
- optimization problems
- travel time
- mixed integer
- np hard
- ant colony optimization
- mixed integer programming
- linear programming
- column generation
- lower and upper bounds
- cutting plane
- facet defining inequalities
- optimal solution
- benchmark problems
- path relinking
- neighborhood search
- continuous variables
- integer program
- branch and bound
- particle swarm optimization
- simulated annealing
- cost function