DECISION FORECAST HORIZON RESULTS FOR A SINGLE FACILITY DYNAMIC LOCATION RELOCATION PROBLEM

This paper provides several decision and forecast horizon results for a dynamic location/relocation problem where the location space is a network and travel is restricted to arcs of the network. A single facility, located at a node of the network, is assumed to supply the customer demands. Customers also are assumed to be located at nodes of the network. The customer demands are assumed to be nonstationary over time. The paper provides a forward dynamic programming algorithm to solve a finite horizon problem. It also provides several dynamic horizon/forecast horizon (DH)/(FH) results. A numerical example has been included to illustrate the results. These results are helpful in finding optimal initial decisions for the infinite horizon problem by using information only for a finite horizon.