Premium
GIS‐Based Analysis of Railway’s Origin/Destination Path‐Selecting Behavior
Author(s) -
Yang Zhongzhen,
Hayashi Yoshitsugu
Publication year - 2002
Publication title -
computer‐aided civil and infrastructure engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 2.773
H-Index - 82
eISSN - 1467-8667
pISSN - 1093-9687
DOI - 10.1111/1467-8667.00270
Subject(s) - destinations , path (computing) , computer science , shortest path problem , transport engineering , geographic information system , geography , computer network , engineering , cartography , tourism , graph , archaeology , theoretical computer science
This study aims to analyze a railway’s OD path‐selecting behavior with microsimulation analysis in big cities. In big cities, railway networks often consist of lines belonging to several different companies, making railway OD path‐selecting behavior very complex. Usually, the second or third nearest stations are used instead of the nearest station. This study takes buildings rather than zones as origins or destinations for simulating railway path‐selecting behavior. First, in the GIS database, we consider whether the destinations are within walking distance of their origins. Then we modify the map‐based railway network with GIS to make it represent the real urban railway network more clearly. Then, from all the available stations for each building, and all the paths between the origin and destination stations, the one involving the shortest distance is the one used.