An algorithm to evaluate public transportation stops for minimizing passenger walking distance

Abstract The problem under consideration is to find the smallest number and location of public transit (buses, P.R.T., etc.) stops, so that no passenger is further away than a preselected distance from a stop. An optimum algorithm is proposed and discussed for a general network in which the nodes are community locations (and therefore it is just an evaluation procedure) and the stops are to be located along the arcs or on nodes.