A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands.
Aljoscha GrulerJavier PanaderoJésica de ArmasJosé A. Moreno-PérezAngel A. JuanPublished in: Int. Trans. Oper. Res. (2020)
Keyphrases
- variable neighborhood search
- metaheuristic
- traveling salesman problem
- tabu search
- hybrid method
- routing problem
- minimum spanning tree
- single period
- single machine scheduling problem
- heuristic methods
- planning horizon
- vehicle routing problem
- integer programming
- benchmark instances
- production planning
- path relinking
- inventory models
- ant colony optimization
- hybrid algorithm
- combinatorial problems
- combinatorial optimization
- optimization problems
- simulated annealing