"Iterated Local Search for the Periodic Location Routing Problem with Fixed Customer-Depot Assignment"
Hadir A. G. Castro, André B. Mendes and Yue Wu

This research proposes an iterated local search (ILS) algorithm for solving the periodic location routing problem, with the additional consideration that each customer must remain assigned to the same depot throughout the planning horizon. This is a practical consideration found in many real-world applications, that has not been properly considered in existing methods. The ILS algorithm will be solved for different network configurations, generated by a MIP assignment model. Instances from the literature will be solved and indicates that the proposed solution method is effective in dealing with this problem.