Resumen de On solving the multi-period location-assignment problem under uncertainty
María Albareda Sambola, Antonio Alonso Ayuso, Laureano Fernando Escudero Bueno, Elena Fernández Aréizaga, María Celeste Pizarro Romero
We present a framework for solving the strategic problem of timing the location of facilities and the assigning of customers to facilities in a multi-period environment under uncertainty in the timing at which the customers need to be assigned to the facilities and the minimum number of customers to be served at each time horizon. By considering a compact mathematical representation of the Deterministic Equivalent Model, we specialize the so-called Branch-and-Fix Coordination algorithmic frame-work. It exploits the structure of the model and, speci cally, the non-anticipativity constraints for the variables.
The algorithm uses the Twin Node Family concept and the Lagrangean substitution bounding. Our procedure is speci cally designed for coordinating the selection of the branching TNF, such that the nonanticipativity constraints are satis ed. Some computational experience is reported.
