Towards a realistic multiperiod location/routing problem

Resumen

In this work we address a multiperiod location/routing problem, where multiple location, allocation, and routing decisions have to be made throughout the planning horizon. In practice, location decisions are often strategic, whereas assignment and routing are seen as operational decisions, made for satisfying the upcomming requests of service in the best possible way. To better represent such situations we consider two dierent scales within the planning horizon: Short periods, in which only assignment and routing decisions are made, and long periods, which include several short periods, when location decisions are also made. Facilities xed at the beginning of a long period remain xed throughout the long period (and thus, during several short periods). Given its diculty we propose an approximation of the problem where, instead of routes, trees rooted at the depots are built. Preliminary computational experiments show that the obtained plant opening patterns are close to optimal ones.