• Title/Summary/Keyword: Route Travel Data

Search Result 91, Processing Time 0.017 seconds

Accurate prediction of lane speeds by using neural network

  • Dong hyun Pyun;Changwoo Pyo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.28 no.5
    • /
    • pp.9-15
    • /
    • 2023
  • In this paper, we propose a method predicting the speed of each lane from the link speed using a neural network. We took three measures for configuring learning data to increase prediction accuracy. The first one is to expand the spatial range of the data source by including 14 links connected to the beginning and end points of the link. We also increased the time interval from 07:00 to 22:00 and included the data generation time in the feature data. Finally, we marked weekdays and holidays. Results of experiments showed that the speed error was reduced by 21.9% from 6.4 km/h to 5.0 km/h for straight lane, by 12.9% from 8.5 km/h to 7.4 km/h for right turns, and by 5.7% from 8.7 km/h to 8.2 km/h for left-turns. As a secondary result, we confirmed that the prediction accuracy of each lane was high for city roads when the traffic flow was congested. The feature of the proposed method is that it predicts traffic conditions for each lane improving the accuracy of prediction.

An Estimation of Generalized Cost for Transit Assignment (대중교통 통행배정을 위한 일반화비용 추정)

  • Son, Sang-Hun;Choe, Gi-Ju;Yu, Jeong-Hun
    • Journal of Korean Society of Transportation
    • /
    • v.25 no.2 s.95
    • /
    • pp.121-132
    • /
    • 2007
  • This paper addressed the issue of a generalized cost model for transit assignment. The model composed of walk time, waiting time (including transfer waiting time), line-haul time, transfer walk time, and fare. The weights of each component were supposed to be calculated using the stated preference (SP) data, which were collected prudently in order to reflect reality. The marginal rate of substitution and wage rate were applied to calculate the weights. The results showed that the weight of walking time per in-vehicle travel time (IVTT) was 1.507, the weight of waiting time (per IVTT) was 1.749, that of transfer time (per IVTT) was 1.474, and that of fare (per IVTT) was 1.476 for trips between inner-city areas in Seoul. Weights for each component were identified as 1.871, 1.967, 1.015, and 0.857, respectively, for trips between Seoul and Gyeonggi. Statistical significance existed between two cases and each variable was also statistically significant. Transit assignment using the relative weights estimated in this study was implemented to analyze the travel index in a macroscopic and quantitative basis. The results showed that average total travel times were 30.23 minutes and 63.29 minutes and average generalized costs were 2,510 won and 3,880 won for trips between inner-city areas in Seoul and between Seoul and Gyeonggi, respectively.

Development of Vehicle Arrival Time Prediction Algorithm Based on a Demand Volume (교통수요 기반의 도착예정시간 산출 알고리즘 개발)

  • Kim, Ji-Hong;Lee, Gyeong-Sun;Kim, Yeong-Ho;Lee, Seong-Mo
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.2
    • /
    • pp.107-116
    • /
    • 2005
  • The information on travel time in providing the information of traffic to drivers is one of the most important data to control a traffic congestion efficiently. Especially, this information is the major element of route choice of drivers, and based on the premise that it has the high degree of confidence in real situation. This study developed a vehicle arrival time prediction algorithm called as "VAT-DV" for 6 corridors in total 6.1Km of "Nam-san area trffic information system" in order to give an information of congestion to drivers using VMS, ARS, and WEB. The spatial scope of this study is 2.5km~3km sections of each corridor, but there are various situations of traffic flow in a short period because they have signalized intersections in a departure point and an arrival point of each corridor, so they have almost characteristics of interrupted and uninterrupted traffic flow. The algorithm uses the information on a demand volume and a queue length. The demand volume is estimated from density of each points based on the Greenburg model, and the queue length is from the density and speed of each point. In order to settle the variation of the unit time, the result of this algorithm is strategically regulated by importing the AVI(Automatic Vehicle Identification), one of the number plate matching methods. In this study, the AVI travel time information is composed by Hybrid Model in order to use it as the basic parameter to make one travel time in a day using ILD to classify the characteristics of the traffic flow along the queue length. According to the result of this study, in congestion situation, this algorithm has about more than 84% degree of accuracy. Specially, the result of providing the information of "Nam-san area traffic information system" shows that 72.6% of drivers are available.

Development of Bus Arrival Time Estimation Model by Unit of Route Group (노선그룹단위별 버스도착시간 추정모형 연구)

  • No, Chang-Gyun;Kim, Won-Gil;Son, Bong-Su
    • Journal of Korean Society of Transportation
    • /
    • v.28 no.1
    • /
    • pp.135-142
    • /
    • 2010
  • The convenient techniques for predicting the bus arrival time have used the data obtained from the buses belong to the same company only. Consequently, the conventional techniques have often failed to predict the bus arrival time at the downstream bus stops due to the lack of the data during congestion time period. The primary objective of this study is to overcome the weakness of the conventional techniques. The estimation model developed based on the data obtained from Bus Information System(BIS) and Bus management System(BMS). The proposed model predicts the bus arrival time at bus stops by using the data of all buses travelling same roadway section during the same time period. In the tests, the proposed model had a good accuracy of predicting the bus arrival time at the bus stops in terms of statistical measurements (e.g., root mean square error). Overall, the empirical results were very encouraging: the model maintains a prediction job during the morning and evening peak periods and delivers excellent results for the severely congested roadways that are of the most practical interest.

Revenue Change by Peak Hour Fare Imposition for Senior Free Ride : Using Seoul Metropolitan Subway Smart Card Data (노인무임승차 첨두시 요금부과에 따른 수입금 변화 : 수도권 스마트카드자료를 이용하여)

  • Seongil Shin;Jinhak Lee;Hasik Lee
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.22 no.2
    • /
    • pp.1-14
    • /
    • 2023
  • This study derives quantitative data on how much the fiscal deficit of subway operation agencies can be reduced in the process of charging free rides for the elderly in metropolitan subways during peak periods. In smart card data, every trip of elderly is recorded except fares. Therefore, it is required to establish a methodology for estimating the fares of elderly passengers and distributing them to subway opertation agencies as income. This study builds a simultaneous dynamic traffic allocation model that reflects the assumption that elderly selects a minimum time route based on the departure time. The travel route of the elderly is estimated, and the distance-proportional fare charged to the elderly is calculated based on this, and the fare is distributed by reflecting the connected railway revenue allocation principle of the metropolitan subway operating agencies. As a result of conducting a case study for before and after COVID-19 in 2019 and 2020, it is analyzed that Seoul Metro's annual free loss of 360 billion won could be reduced 6~8% at the morning peak (07:00-08:59), and 13~16% at the morning and afternoon peak (18:00-19:59).

Query Routing in Road-Based Mobile Ad-Hoc Networks (도로 기반 이동 애드 혹 망에서 질의 처리 방법)

  • Hwang So-Young;Kim Kyoung-Sook;Li Ki-Joune
    • The KIPS Transactions:PartD
    • /
    • v.12D no.2 s.98
    • /
    • pp.259-266
    • /
    • 2005
  • Recently data centric routing or application dependent routing protocols are emerged in mobile ad hoc networks. In this paper, we propose a routing method for query processing in MANET(Mobile Ad hoc NETwork) environment, called road-based query routing, with consideration on real time traffic information of large number of vehicles. In particular, we focus on the method that process arrival time dependent shortest path query in MANET without a central server on the road networks. The main idea of our approach lies in a routing message that includes query predicates based on the road connectivity and on data gathering method in real time from vehicles on the road by ad-hoc network. We unify route discovery phase and data delivery(query processing) phase in our mechanism and reduce unnecessary flooding messages by pruning mobile nodes which are not on the same or neighboring road segments. In order to evaluate the performances of the proposed method, we established a model of road networks and mobile nodes which travel along the roads. The measurement factor is the number of nodes to whom route request is propagated according to each pruning strategy. Simulation result shows that road information is a dominant factor to reduce the number of messages.

Development of Integrated Accessibility Measurement Algorithm for the Seoul Metropolitan Public Transportation System (서울 대도시권 대중교통체계의 통합 시간거리 접근성 산출 알고리즘 개발)

  • Park, Jong Soo;Lee, Keumsook
    • Journal of the Korean Regional Science Association
    • /
    • v.33 no.1
    • /
    • pp.29-41
    • /
    • 2017
  • This study proposes an integrated accessibility measurement algorithm, which is applied to the Seoul Metropolitan public transportation system consisting of bus and subway networks, and analyzes the result. We construct a public transportation network graph linking bus-subway networks and take the time distance as the link weight in the graph. We develop a time-distance algorithm to measure the time distance between each pair of transit stations based on the T-card transaction database. The average travel time between nodes has been computed via the shortest-path algorithm applied to the time-distance matrix, which is obtained from the average speed of each transit route in the T-card transaction database. Here the walking time between nodes is also taken into account if walking is involved. The integrated time-distance accessibility of each node in the Seoul Metropolitan public transportation system has been computed from the T-card data of 2013. We make a comparison between the results and those of the bus system and of the subway system, and analyze the spatial patterns. This study is the first attempt to measure the integrated time-distance accessibility for the Seoul Metropolitan public transportation system consisting of 16,277 nodes with 600 bus routes and 16 subway lines.

Trip Assignment for Transport Card Based Seoul Metropolitan Subway Using Monte Carlo Method (Monte Carlo 기법을 이용한 교통카드기반 수도권 지하철 통행배정)

  • Meeyoung Lee;Doohee Nam
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.22 no.2
    • /
    • pp.64-79
    • /
    • 2023
  • This study reviewed the process of applying the Monte Carlo simulation technique to the traffic allocation problem of metropolitan subways. The analysis applied the assumption of a normal distribution in which the travel time information of the inter-station sample is the basis of the probit model. From this, the average and standard deviation are calculated by separating the traffic between stations. A plan was proposed to apply the simulation with the weights of the in-vehicle time of individual links and the walking and dispatch interval of transfer. Long-distance traffic with a low number of samples of 50 or fewer was evaluated as a way to analyze the characteristics of similar traffic. The research results were reviewed in two directions by applying them to the Seoul Metropolitan Subway Network. The travel time between single stations on the Seolleung-Seongsu route was verified by applying random sampling to the in-vehicle time and transfer time. The assumption of a normal distribution was accepted for sample sizes of more than 50 stations according to the inter-station traffic sample of the entire Seoul Metropolitan Subway. For long-distance traffic with samples numbering less than 50, the minimum distance between stations was 122Km. Therefore, it was judged that the sample deviation equality was achieved and the inter-station mean and standard deviation of the transport card data for stations at this distance could be applied.

Public Transport Network Connectivity using GIS-based Space Syntax (GIS 기반 Space Syntax를 이용한 대중교통 접근성)

  • Jun, Chul-Min
    • Journal of Korea Spatial Information System Society
    • /
    • v.9 no.3
    • /
    • pp.25-33
    • /
    • 2007
  • The local governments of major cities in Korea are giving focus on public transportation to reduce congestion and improve accessibility in city areas. In this regards, the proper measurement of accessibility is now a key policy requirement for reorganizing the public transport network. Public transport routing problems, however, are considered to be highly complicated since a multi-mode travel generates different combinations of accessibility. While most of the previous research efforts on measuring transport accessibility are found at zone-levels, an alternative approach at a finer scale such as bus links and stops is presented in this study. We proposes a method to compute the optimal route choice of origin-destination pairs and measure the accessibility of the chosen modes combination based on topological configuration. The genetic algorithm is used for the computation of the journey paths, whereas the space syntax theory is used for the accessibility. This study used node-link data in GIS instead of axial lines which are manually drawn in space syntax. The resulting accessibilities of bus stops are calibrated by O-D survey data and the proposed process is tested on a CBD of Seoul.

  • PDF

Exploring the Temporal Relationship Between Traffic Information Web/Mobile Application Access and Actual Traffic Volume on Expressways (웹/모바일-어플리케이션 접속 지표와 TCS 교통량의 상관관계 연구)

  • RYU, Ingon;LEE, Jaeyoung;CHOI, Keechoo;KIM, Junghwa;AHN, Soonwook
    • Journal of Korean Society of Transportation
    • /
    • v.34 no.1
    • /
    • pp.1-14
    • /
    • 2016
  • In the recent years, the internet has become accessible without limitation of time and location to anyone with smartphones. It resulted in more convenient travel information access both on the pre-trip and en-route phase. The main objective of this study is to conduct a stationary test for traffic information web/mobile application access indexes from TCS (Toll Collection System); and analyzing the relationship between the web/mobile application access indexes and actual traffic volume on expressways, in order to analyze searching behavior of expressway related travel information. The key findings of this study are as follows: first, the results of ADF-test and PP-test confirm that the web/mobile application access indexes by time periods satisfy stationary conditions even without log or differential transformation. Second, the Pearson correlation test showed that there is a strong and positive correlation between the web/mobile application access indexes and expressway entry and exit traffic volume. In contrast, truck entry traffic volume from TCS has no significant correlation with the web/mobile application access indexes. Third, the time gap relationship between time-series variables (i.e., concurrent, leading and lagging) was analyzed by cross-correlation tests. The results indicated that the mobile application access leads web access, and the number of mobile application execution is concurrent with all web access indexes. Lastly, there was no web/mobile application access indexes leading expressway entry traffic volumes on expressways, and the highest correlation was observed between webpage view/visitor/new visitor/repeat visitor/application execution counts and expressway entry volume with a lag of one hour. It is expected that specific individual travel behavior can be predicted such as route conversion time and ratio if the data are subdivided by time periods and areas and utilizing traffic information users' location.