• Title/Summary/Keyword: Traffic cost

Search Result 1,117, Processing Time 0.028 seconds

A Study on the Internet based Traffic Intersection Control (인터넷 응용 4지교차로제어에 관한 연구)

  • Jin, Hyun-Soo
    • Proceedings of the KAIS Fall Conference
    • /
    • 2008.05a
    • /
    • pp.245-247
    • /
    • 2008
  • Traffic intersection conrol is implemented by the data which is acquired to vechile Loop detector. Traffic intersection control equation is Webster equation, which use passing and delayed vechile number. But webster equation is applied to the spot traffic intersection, it is not used to related traffic intersection network system. There is not the approprate remote traffic intersection control, even if there is, it is high cost local network system. Therefore low cost and expert traffic intersection control is realized by internet referencing next and distant intersection traffic information.

  • PDF

The Analysis of User Cost according to Timing of National Highway Pavement Maintenance-Focusing on the Maesang Bidge Section in Korea

  • Kim, Yunsik;Lee, Minjae
    • International conference on construction engineering and project management
    • /
    • 2015.10a
    • /
    • pp.606-607
    • /
    • 2015
  • The traffic volume on the road shows various trends reflecting regional characteristics for monthly and hourly, and economic loss affecting users varies according to the selected period for the maintenance of road pavements. Therefore, in this study, the user cost (or delay cost) for monthly and hourly on the work zone near the Maesang Bridge Section on Poseung-Gu, Pyeongtaek-si, Gyeonggi-do was calculated using the time series models and VISSIM, and based on the result, the effect of user cost reduction according to the selection of best maintenance period was examined. The analysis result showed that the month of the lowest user cost occurred due to the maintenance of target section was January (10,293,258 KRW/Day×1km) and the month of the greatest user cost occurred was November (13,337,495 KRW/Day×1km).

  • PDF

Design of Distributed Hierarchical Routing Plan Method for Urban Traffic Information System (도시교통정보시스템을 위한 분산 계층 경로탐색 기법 설계)

  • Back, Yeong-Tae;Kim, Sang-Oh
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.2
    • /
    • pp.147-154
    • /
    • 2010
  • This paper suggests new route plan cost calculation and cost-effective route plan algorithm and architecture for the new city traffic information system when it is operated nationwide. New algorithm and architecture estimates cost with traffic speeds which is supported for all different lanes, stratifies logical layer which process different levels' traffic information with diverse traffic patterns and provides different traffic information in the few levels. Also suggested new algorithm supports drivers' customized traffic information through both-way communications and plans routes effectively based on the distance between drivers' start position and destination and different levels which start and end position located. It proposes additional research items and requirement for integration between different cities' traffic information system which the national police agency invested and led.

Minimum Network Connection Cost Algorithm for Partially Survivable Networks Problem of Cellular Telecommunication Systems

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.1
    • /
    • pp.59-64
    • /
    • 2016
  • This paper suggests heuristic algorithm with O(mn) polynomial time complexity using Excel for partially survivable networks optimization problem of cellular telecommunication systems with m cells and n hubs. This problem only can be get the solution using linear programming or LINGO software package. The proposed algorithm connects the cell to hubs in ring network with minimum cost as the connection diversity of each cell. If the traffic of ring network (T) is T>2K for ring capacity (K), we adjust the maximum cost hub to MTSO that has a ascending order of (D/DC)/${\Delta}^+$ cell with each cell traffic demand (D) and ${\Delta}^+$=(MTSO cost-maximum cost hub) than we get the $T{\leq}2K$. Finally, we adjust MTSO to the removed maximum cost hub for the cell with 2K-$T{\geq}$(D/DC) and $_{max}{\Delta}^-$. While we using like this simple method, the proposed algorithm can be get the same optimal solution for experimental data as linear programing and LINGO software package.

Opportunistic Routing for Bandwidth-Sensitive Traffic in Wireless Networks with Lossy Links

  • Zhao, Peng;Yang, Xinyu
    • Journal of Communications and Networks
    • /
    • v.18 no.5
    • /
    • pp.806-817
    • /
    • 2016
  • Opportunistic routing (OR) has been proposed as a viable approach to improve the performance of wireless multihop networks with lossy links. However, the exponential growth of the bandwidth-sensitive mobile traffic (e.g., mobile video streaming and online gaming) poses a great challenge to the performance of OR in term of bandwidth guarantee. To solve this problem, a novel mechanism is proposed to opportunistically forwarding data packets and provide bandwidth guarantee for the bandwidth-sensitive traffic. The proposal exploits the broadcast characteristic of wireless transmission and reduces the negative effect of wireless lossy links. First, the expected available bandwidth (EAB) and the expected transmission cost (ETC) under OR are estimated based on the local available bandwidth, link delivery probability, forwarding candidates, and prioritization policy. Then, the policies for determining and prioritizing the forwarding candidates is devised by considering the bandwidth and transmission cost. Finally, bandwidth-aware routing algorithm is proposed to opportunistically delivery data packets; meanwhile, admission control is applied to admit or reject traffic flows for bandwidth guarantee. Extensive simulation results show that our proposal consistently outperforms other existing opportunistic routing schemes in providing performance guarantee.

Evaluation of a Traffic Lane Closure and Pavement Repair for a Certain Period (Focusing on the Gimcheon~Sunsan Project) (1차로 전면차단 후 도로포장 보수방법의 효과분석 (김천~선산 사례중심))

  • Ryu, Sung Woo;Park, Kwon-Je;Han, SeungHwan;Choi, InGu;Cho, Yoon-Ho
    • International Journal of Highway Engineering
    • /
    • v.18 no.3
    • /
    • pp.11-19
    • /
    • 2016
  • PURPOSES : This study supports the evidence that it is possible to rehabilitate a damaged pavement with a lane closure specifically based on the Gimcheon~Sunsan project. METHODS : The prediction results from the simulation programs were compared with field monitoring, which focused on traffic management planning, congestion (length, time, and passing speed), bypass, and user cost, among others. RESULTS : The research results showed that lane closure application and pavement repair of the aged pavement in Korea were possible, even though the prediction results were minimally different from the field monitoring. The road agency contributes to service life extension of the rehabilitated pavement using this method. CONCLUSIONS : A marginal effect caused by the lane closure was observed on travelling users or vehicles, and the user cost of pavement repair decreased. Therefore, introducing the repair method or rehabilitation in Korea is possible. Information dissemination through various media was properly done to execute the project well. Moreover, the construction area traffic utilized nearby alternative roads. Therefore, improving the repaired pavemen's service life while ensuring that the pavement management agency can provide a road with comfortable user riding quality was possible.

Development of Guidelines for Installing Speed Control Humps (차량과속방지턱의 설치기준 개발에 관한 연구)

  • 문무창;장명순
    • Journal of Korean Society of Transportation
    • /
    • v.12 no.1
    • /
    • pp.137-149
    • /
    • 1994
  • The objective of study is to evaluate the effect of speed control hump on traffic operation and accidents. Three sites were investigated for the change of traffic accidents before and after the hump installation. Vehicle speeds approaching the hump were also analyzed. The study revealed that not only the number of traffic accidents but also the accident severity were significantly reduced by the installation of hump. Further, different types of traffic accidents with lower severity were observed after the hump installation. For the effect of speed reduction by hump, it was found that the speeds observed at 15m upstream of hump were in the range of 36~50 percent of approaching speeds which were not affected by (ie, without) the hump. Economic analysis of hump installation showed the benefit-cost ratio of 4.3 and 11.2 at two sites. Further analysis revealed that the benefit by the accident reduction exceeds the cost by speed reduction and installation capital if AADT is below 43,150 vehicles on two lane highways. It is recommended from the study that humps should be considered on two lane highways of high accident locations for excessive speeds to reduce traffic accidents and severity.

  • PDF

Study on Fatality Risk of Older Driver and Traffic Accident Cost (고령운전자 연령구간별 사망사고 발생위험도와 사고비용 분석 연구)

  • Choi, Jaesung
    • Journal of the Korean Society of Safety
    • /
    • v.33 no.4
    • /
    • pp.111-118
    • /
    • 2018
  • Korea is facing a surge in the aging population, showing that population aged 65 and above will be accounted for 42.5% of the total population in 2065 with the emphasis on the over-80 population consisting of 19.2%. In response to this abrupt change in population structure, the number of traffic fatality accident referring to older driver as aged 65+ years had been increasing from 605 fatalities in 2011 to 815 fatalities in 2015 resulting in increases in 34.7% in oppose to happening to decreases in 17.2% about non-older driver. With Logit analysis based on Newton-Raphson algorithm utilizing older driver's traffic fatality data for the 2011-2015 years, it was found that the likelihood of an accident resulting in a fatality for super older driver aged 80 years and above considerably increased compared to other older driver with aging classification: 2.24 times for violation of traffic lane, 2.04 times for violation of U-turn, 1.48 times for violation of safety distance, 1.35 times for violation of obstacle of passing; also average annual increase of traffic accident cost related to super older driver was fairly increased rather than other older driver groups. Hence, this study proposes that improving and amending transport safety system and Road Traffic Act for super older driver needs to be urgently in action about license management, safe driving education, etc. when considering the increase of over-80 population in the near future. Also, implementing a social agreement with all ages and social groups to apply with advanced driver assistance system for older driver groups will be able to become a critical factor to enhance safe driving over the face of the country.

Legislation-Method Study for the Bimodal Tram Promotion (바이모달 트램(Bimodal Tram) 활성화를 위한 법정비 방안)

  • Yang, Chul-Su;Kim, Hyun-Woong
    • Proceedings of the KSR Conference
    • /
    • 2010.06a
    • /
    • pp.698-702
    • /
    • 2010
  • While past traffic laws have focused on solving problems related to traffic congestion, the current legislation must play a role in reducing the social cost of solving traffic problems by forecasting future issues based on current traffic situations, setting goals in advance, and leading the traffic modal choice-trend. This paper verifies that the bimodal tram should be an alternative means of public transportation and proposes ways to introduce and promote it based on a government subsidy and the modification of traffic laws.

  • PDF

Traffic Grooming Algorithm for minimizing the number of SONET ADM in the WDM Ring Network (WDM 링에서 SONET ADM 수 최소화를 위한 트래픽 grooming 알고리즘)

  • 윤승진;노선식;김수현;김영천
    • Proceedings of the IEEK Conference
    • /
    • 1999.06a
    • /
    • pp.172-175
    • /
    • 1999
  • In this paper, we propose new algorithm to minimize the total cost of overall system in WDM ring networks. The cost of system includes the number of SONET ADMs as well as the number of wavelength. As optical technologies and WDM components are developed, the dominant cost of system is the number of SONET ADMs which is electronic equipment. To reduce the number of SONET ADMs in nonuniform traffic, we propose two algorithms one is the algorithm to construct full circles as many as possible to minimize gaps by cutting and combining the connections. The other is the algorithm to groom circles Into a wavelength to share the maximum number of nodes. The simulation results show that the proposed algorithm is superior to conventional algorithm in nonuniform traffic

  • PDF