A relax-and-price heuristic for the inventory-location-routing problem.
William J. GuerreroCaroline ProdhonNubia VelascoCiro-Alberto AmayaPublished in: Int. Trans. Oper. Res. (2015)
Keyphrases
- depth first search
- search algorithm
- supply chain
- optimal solution
- lot sizing
- lead time
- combinatorial optimization
- tabu search
- constraint satisfaction
- simulated annealing
- heuristic methods
- dynamic programming
- multi item
- fixed cost
- profit maximization
- linear program
- safety stock
- inventory management
- inventory systems
- dynamic pricing
- holding cost
- planning horizon
- vehicle routing problem
- search strategies