On Network Dynamic Planar Location Problem Based on Matrix Operation

In the actual logistics distribution systems, the demand and the cost can change with time. Many models solving the location problem are stationary models, in which time factors are not considered. This paper develops a dynamic location model in which the time influences the demand, applies matrix operation method to a case and analyses how to make a location decision and bring the minimum total costs, during a company´s planning horizon. This method is visual and simple, especially, it isn´t necessary that the optimizing decision is obtained by working backward from the end of a problem toward the beginning comparing with dynamic programming.