Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs.
Faisal AlkaabnehAli DiabatHuaizhu Oliver GaoPublished in: Comput. Oper. Res. (2020)
Keyphrases
- vehicle routing problem
- benders decomposition
- production cost
- lead time
- total cost
- vehicle routing
- mixed integer
- inventory level
- exact algorithms
- setup cost
- lot sizing
- network design problem
- tabu search
- combinatorial optimization
- lost sales
- routing problem
- knapsack problem
- expected cost
- metaheuristic
- dynamic pricing
- benchmark problems
- optimal solution
- production planning
- travel time
- inventory control
- traveling salesman problem
- feasible solution
- supply chain
- combinatorial optimization problems
- particle swarm optimization
- np hard
- simulated annealing
- branch and bound
- search strategies
- approximation algorithms
- genetic algorithm
- mixed integer programming
- integer programming
- constraint satisfaction problems
- scheduling problem
- probabilistic model