An Iterated Local Search for Solving A Location-Routing Problem

This paper focuses on a location routing problem with multiple capacitated depots. Our aim is to deal with this problem by considering the decisions of location and routing simultaneously. We develop an iterative local search to deal with this problem. The fundamental feature is to improve the solution successively by intensifying the solution space with the local search. A computational study is provided to compare our approach with the tabu search heuristic.