An Improved Single-Commodity Flow Formulation for the Vehicle Routing Problem with a Heterogeneous Fleet.
DevanandPublished in: INOC (2024)
Keyphrases
- vehicle routing problem
- single commodity
- multi commodity
- heuristic solution
- knapsack problem
- metaheuristic
- flow network
- tabu search
- optimal solution
- vehicle routing problem with time windows
- benchmark problems
- facility location
- np hard
- feasible solution
- routing problem
- network flow problem
- mixed integer
- lower bound
- combinatorial optimization
- traveling salesman problem
- optimization problems
- travel time
- max min
- network design problem
- mathematical programming
- simulated annealing
- network design
- search strategies
- resource allocation
- pick up and delivery
- exhaustive search
- vehicle routing problem with simultaneous
- branch and bound
- constraint programming
- greedy algorithm
- search space