Abstract
Recently, attention to the railway transportation has been revived from the viewpoint of alleviating environmental problems such as reduction of CO2 emission amount. Moreover, commuter train services in urban areas and long distance train services such as Shinkansen are indispensable in Japan.
In this paper, we formulate the train arrival and departure optimization problem at a terminal station as a 0-1 integer programming problem, and we obtainined solutions by using a solver for the case of Tokyo Station of Tohoku Shinkansen. Moreover, we transform this problem in polynomial time to the Maximum matching problem in a bipartite graph when some realistic conditions are assumed.
