Determination of stations where rapid trains stop, or pass to local ones, using a genetic algorithm to shorten total trip time

摘要

This research is focussed on shortening the total trip time for passengers with the operation of rapid trains and is included in the improvement of the train diagram. To this aim, the combination of the stations where rapid trains stop, or pass to local ones, needs to be properly set. However, a best solution is not calculated in real computational time using a round robin method, because there are complex relationships between the OD (origin and destination), combination of stations and operational effects of the trains. In this paper, we describe a solution to the problem using a genetic algorithm (GA). We determined that the operation of the trains at a station can be classified by the following four conditions: 1. Rapid trains stop or pass 2. Rapid trains pass, or do not pass, to local trains These result in a difference of train diagrams at the station. A gene-code in GA expresses these four classified codes. A chromosome consisting of these chain codes denotes a train diagram on an applied line. The length of a chromosome is the number of stations on the line. Whereas, the resulting combination of the stations is a near best solution, it may not be perfect. However, it is shown that the possibility of a shorter total trip time is approximately 11[%] compared with the time of a real train diagram pattern for a real subway line in Tokyo. The reason for this is considered to be a result of the random effects of the GA.