• Title/Summary/Keyword: Traffic Route

Search Result 666, Processing Time 0.026 seconds

Analysis of Diversion Rate using Expressway Traffic Data(FTMS, TCS): Focusing on Maesong~Balan IC at Seohaean Expressway (고속도로 교통데이터(FTMS, TCS)를 이용한 경로전환율 분석: 서해안고속도로 매송~발안 구간을 중심으로)

  • Ko, Han-Geom;Choi, Yoon-Hyuk;Oh, Young-Tae;Choi, Kee-Choo
    • Journal of Korean Society of Transportation
    • /
    • v.30 no.3
    • /
    • pp.31-41
    • /
    • 2012
  • Due to growing interests in the distribution of traffic volume through information dissemination such as VMS and traffic broadcasting system, the research on the driver's reaction and effect of the traffic report has continued. In this study, we propose a methodology, which estimates the traffic volume of diversion and the consequential diversion rate using FTMS data and TCS data, and the estimation is based on the analysis of the national highway and IC, in which real-time FTMS and TCS data are established. We also calculate the diversion rate of actual targeted sections and analyze the changes in time and spatial diversion rate. In this study, we define a deviation (considering a deviation due to dynamic properties of traffic conditions) found when the outflow traffic volume is temporarily higher than the average outflow traffic volume on a relevant time slot after providing traffic information. The diverting volume is considered to be caused by the traffic information, and the study determines the ratio of traffic volume on highways to that of route diversion as the diversion rate. The analysis on changes in the diversion rate in accordance with the time flow, the initial change in the diversion rate on upstream IC that first acquires the report on the traffic congestion is significant. After that, the change in the diversion rate on upstream IC affects the route diversion on downstream IC with spatial and time flow, and this again leads the change in upstream IC. Thereby, we confirmed that there is a feedback-control circulation system in the route diversion.

Trajectory Based Air Traffic Analysis Software Design for Dynamic Airspace Configuration (동적 공역 형상관리를 위한 궤적기반 항공 교통량 분석 소프트웨어 설계)

  • Kim, Hyoun-Kyoung;Eun, Yeon-Ju;Oh, Eun-Mi
    • Aerospace Engineering and Technology
    • /
    • v.12 no.1
    • /
    • pp.173-181
    • /
    • 2013
  • In this paper, the design result of the trajectory-based air traffic analysis software which is going to be used to assess air-traffic efficiency in case that some modification's made in dynamic airspace configuration, is described. The software has been developed to make statistical data about air-traffic in Incheon FIR based on the RPL, and to analyze the airway utilization and controller workload using the trajectory modeling data which are derived from the aircraft type, cruise speed, cruise altitude, and routes and fixes in the RPL. Since it batch-processes the long-term trajectory data with other inputs such as airspace, route information and so on, it has the advantage of quickly predicting the traffic variation when some change in airspace and route information is made.

Route Travel Time Stabilization by Real Time Traffic Information Improvement (실시간 교통정보 제공수준향상에 의한 경로통행시간의 안정화)

  • Lee Chung-Won
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.2 no.1 s.2
    • /
    • pp.101-108
    • /
    • 2003
  • When drivers encounter multiple available routes, they may evaluate the utility of each route. Two important factors in the evaluation are travel time and travel cost. Without hewing the current travel time of each route, drivers' decisions are not necessarily optimum. It is called 'transparency issue' that drivers are blinded to choose the optimum route among the others because of the limited travel time information. As a result of this, competing route travel times tend to fluctuate. This case study to utilize the data of Namsan traffic information system confirms that this travel time fluctuation can be lessened as real time traffic information is provided.

  • PDF

Mechanistic-Empirical Guideline for Routine Overweight Truck Traffic Routes (과하중 트럭 운행 도로에 대한 역학적-경험적 지침)

  • Oh, Jeongho
    • Journal of the Society of Disaster Information
    • /
    • v.9 no.1
    • /
    • pp.1-10
    • /
    • 2013
  • The main objective of this research is to develop the Mechanistic-Empirical (M-E) guidelines for evaluating the capacity of existing highways to sustain route overweight truck traffic over a specified performance period due to a growing concern on the impact of increasing overweight truck loads on highways. In this study, a two-stage framework was developed for this purpose. Level I procedure involves the use of pavement evaluation charts to identify the best possible route from among the alternatives considered and to determine what additional tests and analyses are needed as a screening tool. Level II involves the application of the Overweight Truck Route Analysis (OTRA) program to evaluate the structural adequacy of an existing route to carry routine overweight truck traffic over the specified performance period along with estimating asphalt concrete overlay thickness, if necessary.

Drivers' Learning Mechanism and Route Choice Behavior for Different Traffic Conditions (교통상황에 따른 운전자의 경로선택과 학습행동에 관한 연구)

  • 도명식;석종수;김명수;최병국
    • Journal of Korean Society of Transportation
    • /
    • v.21 no.3
    • /
    • pp.97-106
    • /
    • 2003
  • When a route choice is done under uncertainty, a driver has some expectation of traffic conditions that will occur according to the route chosen. This study tries to build a framework in which we can observe the learning behavior of the drivers' expectations of the travel time under nonstationary environment. In order to investigate how drivers have their subjective expectations on traffic conditions in response to public information, a numerical experiment is carried out. We found that rational expectations(RE) formation about the route travel time can be expressed by the adaptive expectation model when the travel time changes in accordance with the nonstationary process which consists of permanent shock and transient shock. Also, we found that the adaptive parameter of the model converges to the fixed value corresponding to the route conditions.

A Route Selection Algorithm using a Statistical Approach (통계적 기법을 이용한 경로 선택 알고리즘)

  • Kim, Young-Min;Ahn, Sang-Hyun
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.1
    • /
    • pp.57-64
    • /
    • 2002
  • Since most of the current route selection algorithms use the shortest path algorithm, network resources can not be efficiently used also traffics be concentrated on specific paths resulting in congestgion. In this paper we propose the statistical route selections(SRS) algorithm which adopts a statistical mechanism to utilize the network resource efficiently and to avoid congestion. The SRS algorithm handles requests on demand and chooses a path that meets the requested bandwidth. With the advent of the MPLS it becomes possible to establish an explicit LSP which can be used for traffic load balancing. The SRS algorithm finds a set of link utilizations for route selection, computes link weights using statistical mechanism and finds the shortest path from the weights. Our statistical mechanism computes the mean and the variance of link utilizations and selects a route such that it can reduce the variance and the number of congested links and increase the utilization of network resources. Throughout the simulation, we show that the SRS algorithm performs better than other route selection algorithms on several metrics like the number of connection setup failures and the number of congested links.

En-Route Trajectory calculation using Flight Plan Information for Effective Air Traffic Management

  • Kim, Yong-Kyun;Jo, Yun-Hyun;Yun, Jin-Won;Oh, Taeck-Keun;Roh, Hee-Chang;Choi, Sang-Bang;Park, Hyo-Dal
    • Journal of Information Processing Systems
    • /
    • v.6 no.3
    • /
    • pp.375-384
    • /
    • 2010
  • Trajectory modeling is foundational for 4D-Route modeling, conflict detection and air traffic flow management. This paper proposes a novel algorithm based Vincenty's fomulas for trajectory calculation, combined with the Dijkstra algorithm and Vincenty's formulas. Using flight plan simulations our experimental results show that our method of En-route trajectory calculation exhibits much improved performance in accuracy.

Study on Consideration Plan of Environmental Influence in Preliminary Feasibility Investigation of Railroad Work (철도사업의 예비타당성조사시 환경영향 고려방안에 관한 연구)

  • Sun, Hyo-Sung;Park, Young-Min
    • Proceedings of the KSR Conference
    • /
    • 2006.11b
    • /
    • pp.1178-1183
    • /
    • 2006
  • This paper describes the plans of considering the environmental influences in the preliminary feasibility investigation of railroad work. Because the cost-benefit analysis method about the environmental costs by air pollution and traffic noise is mainly applied in preliminary feasibility investigation, not only the verification in the calculation method of these environmental costs but also the consideration in the environmental costs of the topographical damage and the ecosystem extinction by railroad work is needed. The environment-friendly plans in choosing the locations of the railroad route and station are also suggested, and they include (1) consideration of environment protection area, residential zone, and region with scenic beauty, (2) application of the existing railroad route and station, and (3) railroad route parallel to another traffic facility.

  • PDF

AI Chatbot Providing Real-Time Public Transportation and Route Information

  • Lee, So Young;Kim, Hye Min;Lee, Si Hyun;Ha, Jung Hyun;Lee, Soowon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.7
    • /
    • pp.9-17
    • /
    • 2019
  • As the artificial intelligence technology has developed recently, researches on chatbots that provide information and contents desired by users through an interactive interface have become active. Since chatbots require a variety of natural language processing technology and domain knowledge including typos and slang, it is currently limited to develop chatbots that can carry on daily conversations in a general-purpose domain. In this study, we propose an artificial intelligence chatbot that can provide real-time public traffic information and route information. The proposed chatbot has an advantage that it can understand the intention and requirements of the user through the conversation on the messenger platform without map application.

M_CSPF: A Scalable CSPF Routing Scheme with Multiple QoS Constraints for MPLS Traffic Engineering

  • Hong, Daniel W.;Hong, Choong-Seon;Lee, Gil-Haeng
    • ETRI Journal
    • /
    • v.27 no.6
    • /
    • pp.733-746
    • /
    • 2005
  • In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.

  • PDF