Optimizing Train Stopping Patterns for Congestion Management

In this paper, we optimize train stopping patterns during morning rush hour in Japan. Since trains are extremely crowded, we need to determine stopping patterns based not only on travel time but also on congestion rates of trains. We exploit a Wardrop equilibrium model to compute passenger flows subject to congestion phenomena and present an efficient local search algorithm to optimize stopping patterns which iteratively computes a Wardrop equilibrium. We apply our algorithm to railway lines in Tokyo including Keio Line with six types of trains and succeed in relaxing congestion with a small effect on travel time

A 2.75-Approximation Algorithm for the Unconstrained Traveling Tournament Problem

A 2.75-approximation algorithm is proposed for the unconstrained traveling tournament problem, which is a variant of the traveling tournament problem. For the unconstrained traveling tournament problem, this is the first proposal of an approximation algorithm with a constant approximation ratio. In addition, the proposed algorithm yields a solution that meets both the no-repeater and mirrored constraints. Computational experiments show that the algorithm generates solutions of good quality.Comment: 12 pages, 1 figur

カッティング パッキング モンダイ ニ タイスル キョクショ タンサクホウ ニ カンスル ケンキュウ

京都大学0048新制・課程博士博士(情報学)甲第11002号情博第102号新制||情||25(附属図書館)UT51-2004-G849京都大学大学院情報学研究科数理工学専攻(主査)教授 茨木 俊秀, 教授 福嶋 雅夫, 教授 髙橋 豊学位規則第4条第1項該当Doctor of InformaticsKyoto UniversityDA