Sequential and parallel large neighborhood search algorithms for the periodic location routing problem
We develop different sequential and parallel metaheuristics for the periodic location routing problem. Computational results show that our algorithms outperform previous methods. We also suggest a simple and effective parallelization strategy.
large neighborhood search location routing parallel metaheuristics