1987 Volume 22 Pages 475-480
In this study, we discuss the relationship between the number of stations and the average commuting time on a railway, when the locations of the stations are optimized. First, we assume that the work place has a uniform dencity and a fixed interval on a railway, and calculate the average commuting time from outside of the work place. Then this optimizing problem can be given as quadratic programming problem. As the numerical result, near the optimal solution the average commuting time is not so sensitive to the number of stations.