2C2 OPTIMAL ASSIGNMENT OF RAPID TRAIN STOPS : EXAMPLE OF THE JR NAMBU LINE(Technical session 2C: OS2: Timetabling and assignment problems(1))

スポンサーリンク

概要

• 論文の詳細を見る

• Travel time for train passengers and their convenience are strongly dependent on the assignment of rapid train stops and the timetable of train operation. This paper proposes an algorithm to assign rapid train stops and to determine the associated timetable such that the total travel time for passengers is minimized. Taking the JR Nambu line in Japan as an example, we demonstrate the optimal assignment of rapid train stops and the associated timetable.

• 一般社団法人日本機械学会の論文
• 2011-07-02

著者

• Miyashiro Ryuhei

  Institute of Engineering Tokyo University of Agriculture and Technology

• OKADA Keiya

  Graduate School of Engineering, Tokyo University of Agriculture and Technology

関連論文

• Dependent Randomized Rounding to the Home-Away Assignment Problem in Sports Scheduling(Discrete Mathematics and Its Applications)
• Optimization of alignment in semiconductor lithography equipment
• Optimization of Assignment of Rapid Train Stops: Example of the JR Nambu Line
• 2C2 OPTIMAL ASSIGNMENT OF RAPID TRAIN STOPS : EXAMPLE OF THE JR NAMBU LINE(Technical session 2C: OS2: Timetabling and assignment problems(1))

スポンサーリンク