A Concert Problem in a Network Space and Its Application to the Analysis of the Railway Network of Tokyo Metropolytan Area

Abstract

This paper proposes a maximum flow-covering location model considering the time dimension in a network space. The problem is to decide the location and the starting time of a concert (or any other service) that maximizes the total number of potential customers. The number of potential customers is defined as the number of office workers that can attend the concert after their work from start to end and can arrive home by a given time. This model is applied to the analysis of the optimal starting time of an evening graduate school using the railway network in Tokyo Metropolitan Area.