Keywords: train information provision, train choice, passengers' behavioral mode, travel delaytrains, their reasons for choosing them, the level of difficulty in choosing trains, and also passenger reactions to being given information about arrival sequences, which turned out to be incorrect. Providing detailed information about individual trains Attitude to train traffic information in the case of disruptionsPrevious research [1, 2] has already examined and highlighted the specific types of information that passengers need when train operations are disrupted. In order to understand passengers' attitudes to traffic information and choosing trains, and to help decide how best to provide that information, the following survey was conducted: Passengers were asked to consider two ways of thinking, A and B. They were then asked to indicate which best reflected their own way of thinking, on a scale of 1 to 7 (1: very similar to A; 2: similar to A; 3: somewhat similar to A; 4: neutral; 5: somewhat similar to B; 6: similar to B; 7: very similar to B).A: Rather than reading detailed information about the trains, I want to be told exactly which train I should ride. (For example, to arrive quickly at my destination I should take this train; to avoid congestion I should ride that train, etc.) B: I will choose which train to take myself, so I want to be provided with detailed traffic information to enable me to make my own decision.
SUMMARYWe developed a high-speed telecommunication system for use on railways to improve customer service and the efficiency of operator's telecommunications between ground facilities and trains under operation. We built a mobile telecommunication system, capable of achieving a transfer rate of 1 Gbps in theory, by utilizing laser beam communications technology. We carried out a field test
It is important for railway operators to make suitable timetables. On the assumption that passengers' train paths are invariant even if the timetable changes, the timetables are determined according to the various statistical data under the current timetable. In planning the timetable, it is difficult to grasp the change of passengers' paths due to timetable modifications because it is too complex. In this paper, we propose a framework of timetabling with due consideration of the path change and propose a practical timetabling system which can quickly estimate the congestion of each train by using passengers' origin-destination (OD) data collected by automatic ticket checkers. With the system, timetable planners can interactively make and modify timetables by trial and error while confirming the congestion, and finally, they can reach the most preferable one. In order to realize such an interactive system, it is important to develop a fast estimation algorithm of train congestion. We developed a new shortest path search algorithm to determine which trains each passenger gets on. The algorithm devised based on the Dijkstra method has two features. First, the shortest path search from each node to all the destination stations in the composed graph network is executed only once. Second, overlapping the path searches are omitted using stored information of the shortest paths which have already been searched. By applying this algorithm, it took only about 10 s to estimate the train congestion under a timetable of the whole day on an urban commuter line.
It is important for railway operators to make suitable timetables. On the assumption that passengers' train paths are invariant even if the timetable changes, the timetables are determined according to the various statistical data under the current timetable. In planning the timetable, it is difficult to grasp the change of passengers' paths due to timetable modifications because it is too complex. In this paper, we propose a framework of timetabling with due consideration of the path change and propose a practical timetabling system which can quickly estimate the congestion of each train by using passengers' origin-destination (OD) data collected by automatic ticket checkers. With the system, timetable planners can interactively make and modify timetables by trial and error while confirming the congestion, and finally, they can reach the most preferable one. In order to realize such an interactive system, it is important to develop a fast estimation algorithm of train congestion. We developed a new shortest path search algorithm to determine which trains each passenger gets on. The algorithm devised based on the Dijkstra method has two features. First, the shortest path search from each node to all the destination stations in the composed graph network is executed only once. Second, overlapping the path searches are omitted using stored information of the shortest paths which have already been searched. By applying this algorithm, it took only about 10 s to estimate the train congestion under a timetable of the whole day on an urban commuter line.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.