"An iterated local search algorithm for solving a practical rich location routing problem" Raphael Kramer, Nilson Felipe Matos Mendes, Giorgio Zucchi and Manuel Iori We present and solve a rich vehicle routing problem (RVRP) derived from two realistic cases involving the delivery of pharmaceuticals to healthcare establishments, in Italy. The studied problem is characterized by having many features and constraints, such as multiple depots, multiple periods, heterogeneous fleet, time-windows, and site-dependency (i.e., customer-vehicle incompatibilities). In addition, decisions related to the supply and the location of the depots, and the installation of warehouses in the hospitals are considered. To solve the problem we propose an iterated local search (ILS) algorithm enhanced with classical neighborhoods and auxiliary data structures from the literature. The proposed algorithm is evaluated through computational experiments by solving realistic and artificial instances We also present a sensitive analysis to evaluate the routing costs and the algorithm performance by changing the maximum number of depots allowed to be opened.