• Journal of Korean Society of Transportation
• /
• v.29 no.6
• /
• pp.7-16
• /
• 2011

This study investigates the degree of dependency on freeways when auto travelers make route choices in the Seoul Metropolitan Area. The investigation is conducted based on aggregated auto trip data, defining the degree of dependency as the proportion of auto trips selecting freeways in their travel paths. The analyses reveal that the trips departing from the areas with higher accessibility to freeways tend to exhibit higher dependency on freeways. In addition, the dependency is significantly affected by the travel time differences between two paths including and excluding freeways, respectively. The number of service interchanges was found to be one of significant factors for trips to Incheon and Gyenggi areas. The finding indicates that the factors affecting the degree of dependency on freeways may vary depending on the areas' characteristics. The findings would enhance the understanding of drivers' route choice behavior in Seoul at an aggregate level.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.14 no.6
• /
• pp.37-49
• /
• 2015

In Space Syntax, the greater the degree of integration between separate links, the greater the links' accessibility from the target network. As such, planning pedestrian walks so that links with high degrees of integration are connected, or else inducing high integration value land use are both valid options. The travel distribution model reflects how walking demand, or more specifically, the pedestrian, partakes in route choosing behavior that minimizes select criteria, notably level of discomfort, as measured using travel distance and time. The model thus demonstrates travel patterns associated with demand pertaining to minimization of discomfort experienced by the pedestrian. This research introduces a method that integrates Space Syntax and the pedestrian travel distribution model. The integrated model will determine whether regions with high degrees of integration are actually being used as pivots for pedestrian demand movement, as well as to explain whether the degree of integration is sustained at an appropriate level while considering actual movement demand. As a means to develop the integrated model, a method that combines display of the visibility of the space syntax network and road-divided links is proposed. The pedestrian travel distribution model also includes an alternative path finding mechanism between origin and destination, which allows for uniform allocation of demand.

• Journal of Korean Society of Transportation
• /
• v.28 no.2
• /
• pp.53-64
• /
• 2010

This study is aimed at identifying the association of change of travel frequencies with information and communications technologies, commuting behavior for 995 workers in the Korea Capital Region. The study surveyed total 995 commuters whose their individual character, commuting behavior, land use as well as ICTs. The measures of the commuting behavior was comprised of a main commuting mode, a use tern, total travel time, and those of land use was the distance from house/office to subway station, and those of ICTs was data and information collection, communication and leisure, online selling or purchases, finance and a civil application, cellular phone service using capacity and so on. The results indicate that commuting behavior, land use, and ICTs are positively associated to change of travel frequencies. Specifically, longer total travel time, or far from house/office to subway station, tend to reduce commuting behavior and collect data and information through internet

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.5
• /
• pp.38-45
• /
• 2012

Finding shortest paths on time dependent networks is an important task for scheduling and routing plan and real-time navigation system in ITS. In this research, one-to-one time dependent shortest path algorithms based on link flow speeds on urban networks are proposed. For this work, first we select three general shortest path algorithms such as Graph growth algorithm with two queues, Dijkstra's algorithm with approximate buckets and Dijkstra's algorithm with double buckets. These algorithms were developed to compute shortest distance paths from one node to all nodes in a network and have proven to be fast and efficient algorithms in real networks. These algorithms are extended to compute a time dependent shortest path from an origin node to a destination node in real urban networks. Three extended algorithms are implemented on a data set from real urban networks to test and evaluate three algorithms. A data set consists of 4 urban street networks for Anaheim, CA, Baltimore, MD, Chicago, IL, and Philadelphia, PA. Based on the computational results, among the three algorithms for TDSP, the extended Dijkstra's algorithm with double buckets is recommended to solve one-to-one time dependent shortest path for urban street networks.

• Journal of the Korean Society for Railway
• /
• v.19 no.5
• /
• pp.656-662
• /
• 2016

Based on time dependent location data of mobile phone users, users' ODs were produced after tracing their travel route and inducing their origins and destinations. System considered average signalizing frequency, which means that the longer the travel length is the more frequent the signal is. This is a home-based OD and is limited to the Seoul Metropolitan area. The OD matrix from the mobile phone data which was aggregated to the cell and transformed to the 'Dong' area, was compared to the KTDB OD. The results can be analyzed and it was determined that they are highly correlated because individual coefficients are 0.98 and 0.85, the former between the OD of this study and the KTDB Si/Gun/Gu unit area OD and the latter between the OD of this study and the Dong unit area KTDB OD.

• Journal of Korean Society of Transportation
• /
• v.22 no.6
• /
• pp.101-108
• /
• 2004

The new transit fare in the Seoul Metropolitan is basically determined based on the distance-based fare system (DBFS). The total fare in DBFS consists of three parts- (1) basic fare, (2) transfer fare, and (3) extra fare. The fixed amount of basic fare for each mode is charged when a passenger gets on a mode, and it proceeds until traveling within basic travel distance. The transfer fare may be added when a passenger switches from the present mode to another. The extra fare is imposed if the total travel distance exceeds the basic travel distance, and after that, the longer distance the more extra fare based on the extra-fare-charging rule. This study proposes an algorithm for finding minimum fare route in DBFS. This study first exploits the link-label-based searching method to enable shortest path algorithms to implement without network expansion at junction nodes in inter-modal transit networks. Moreover, the link-expansion technique is adopted in order for each mode's travel to be treated like duplicated links, which have the same start and end nodes, but different link features. In this study, therefore, some notations associated with modes can be saved, thus the existing link-based shortest path algorithm is applicable without any loss of generality. For fare calculation as next steps, a mathematical formula is proposed to embrace fare-charging process using search process of two adjacent links illustrated from the origin. A shortest path algorithm for finding a minimum fare route is derived by converting the formula as a recursive form. The implementation process of the algorithm is evaluated through a simple network test.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.3D
• /
• pp.361-366
• /
• 2006

It is widely known that the dynamic optimal path algorithm, adopting real-time path finding, can be supporting an optimal route with which users are satisfied economically and accurately. However, this system has to search optimal routes frequently for updating them. The proposed concept of optimizing search area lets it reach heuristic optimal path rapidly and efficiently. Since optimal path should be increased in proportion to an distance between origin and destination, tremendous calculating time and highly efficient computers are required for searching long distance journey. In this paper, as a result of which the concepts of partial solution and representative path are suggested. It was possible to find an optimal route by decreasing a half area in comparison with the previous method. Furthermore, as the size of the searching area is uniform, comparatively low efficient computer is required for long distance trip.

• Journal of Korean Society of Transportation
• /
• v.23 no.5 s.83
• /
• pp.157-167
• /
• 2005

Seoul metropolitan public transport reform results in the introduction of the semi-public operation and distance-based fare policies. With implementation of these policies, public transport revenue allocation has been (will be) evolved very complicated because the existing revenue allocation issues have not only been clearly solved, which is generated by the combined relationship among Korea Railroad Corporation (KRC). Seoul Metropolitan Subway Corporation (SMSC). Seoul Metropolitan Rapid Transit Corporation (SMRTC), and Incheon Rapid Transit Corporation (IRTC), but also the revenue allocation problem between bus and urban railroad-related organizations need to be considered in this combined framework. On top of that. based on the future plans such as the private sector's railroad construction plan(s), the light rail transit construction plans of several local governments and the join of remained bus lines of Seoul metropolitan areas, it is understood that the revenue allocation among public transport operating organization will become one of main issues of operation organization as well as local and central governments. As a basic approach for revenue allocation of public transport operation organizations, the purpose of this paper is to propose an integrated model applicable to estimate degree of service contribution in passenger carriage in the combined public transport network. With a hypothesis that the complete electronic card system is deployed, this paper supposes every passenger's loading and alighting stations is recordable. Thereby, this paper limits research scope as to Seoul metropolitan railroad area since used route(s) between origin and destination stations can not be traceded because transfer stations each passenger path through is not recorded. Each model proposed in the paper is as follows: 1. a generalized cost reflecting passenger's transfer behavior; 2.a K path model for determining similar routes between O-D; 3.an assignment model for loading O-D trips onto the detected similar routes using Logit Model.

• Journal of the Economic Geographical Society of Korea
• /
• v.18 no.4
• /
• pp.539-555
• /
• 2015

This study proposes the methodology for measuring the time-distance accessibility on the Seoul bus system based on the T-card transaction databases and analyzes the results. T-card transaction databases contain the time/space information of each passenger's locations and times of the departure, transfers, and destination. We introduce the bus network graph and develop the algorithms for time-distance accessibility measurement. We account the average speed based on each passenger's get-in and getoff information in the T-card data as well as the average transfer time from the trip chain transactions. Employing the modified Floyd APSP algorithm, the shortest time distance between each pair of bus stops has been accounted. The graph-theoretic nodal accessibility has been given by the sum of the inverse time distance to all other nodes on the network. The results and spatial patterns are analyzed. This study is the first attempt to measure the time-distance accessibility for such a large transport network as the Seoul bus system consists of 34,934 bus stops on the 600 bus routes, and each bus route can have different properties in terms of speed limit, number of lanes, and traffic signal systems, and thus has great significance in the accessibility measurement studies.

• Journal of Korean Society of Transportation
• /
• v.28 no.4
• /
• pp.129-139
• /
• 2010

This study proposes a model for measuring the connectivity of nodes in road networks. The connectivity index between two nodes is characterized by the number of routes, degree of circuitousness, design speed, and route capacity between the nodes. The connectivity index of a node is then defined as the weighted average of the connectivity indexes between the node and other nodes under consideration. The weighting factor between two nodes is determined by the travel demand and distance between them. The application of the model to a toy network shows that it reasonably well quantifies the level of connectivity of nodes in the network. If flow of rail networks can be measured in the same scale as that of road networks and the capacity of rail links can be estimated, the model proposed in this paper could be applied to intermodal transportation networks as well.