An iterated local search algorithm for the single-vehicle cyclic inventory routing problem
We define and situate the Single-Vehicle Inventory Routing Problem (SV-CIRP). We discuss and exploit some complex characteristics of the SV-CIRP. We design an efficient iterated local search technique for the SV-CIRP. Our approach outperforms the best available algorithm with 16.02% on average. Our approach is significantly faster and 32 new best known solutions are presented.
iterated local search single-vehicle cyclic inventory routing problem inventory routing metaheuristic