• Title/Summary/Keyword: 요금정산

Search Result 46, Processing Time 0.016 seconds

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.

A Study on the Charge of Using the Internet Network - Focusing on U.S. Internet History and Charter Merger Approval Conditions Litigation - (인터넷 망 이용의 유상성에 대한 고찰 - 미국 인터넷 역사 및 Charter 합병승인조건 소송 중심으로 -)

  • Cho, Dae-Keun
    • Journal of Internet Computing and Services
    • /
    • v.22 no.4
    • /
    • pp.123-134
    • /
    • 2021
  • This paper suggests that the Internet is not free through analysis of U.S. Internet history and lawsuits related to the Charter merger in 2016. Generally speaking, the players in internet connectivity market agree to Non-Disclosure Agreement, when connecting their facilities and networks each other. So, I adopted the case study & analysis as research methodologies due to limitation of collecting the transaction data between them. The former finds that Internet access has never been free in U.S Internet history. As we know, some including Content Providers(CPs) argue that the Internet is a free network and there are many cases to use the internet for free, so they came to conclusion that ISPs have no right to charge the users like CPs. This study refutes these arguments in two ways. One is that using the internet has never been free. From ARPANET, known as the beginning of the U.S. Internet, to the commercialization of backbone, no Internet has been considered or implemented for free since the early Internet network was devised. Also, the U.S government was paying subsidies or institutions were paying fees to secure network operations for the NSFNET backbone. the other is that "free peering" refers to barter transactions between ISPs, not to free access to counterpart internet networks. Second, this study analyze the FCC' executive order of conditioned merger approval and the court's related ruling and verify that using the internet is not free. According to the analysis, this study finds that it's real situation to make paid settlements between ISP-CPs (including OTTs) in the US Internet market at the moment. This study concludes that the Internet has never been free in terms of its technical characteristics, network structure, network operation, and system. Also it proposes how to improve the domestic settlement system between ISPs-CPs in terms of policy and regulation.

Alternatives for New Internet Interconnection Policy (인터넷 상호접속제도 개선을 위한 대안 탐색 연구: 2016년 1월 개정안을 중심으로)

  • Cho, Hosoo;Shin, Hyunha;Ryu, Min Ho
    • Journal of Internet Computing and Services
    • /
    • v.21 no.1
    • /
    • pp.1-15
    • /
    • 2020
  • This study explores reasonable alternatives to internet interconnection policy. Due to the development of information and communication technology, patterns of the Internet usage are changing rapidly, including increase of video streaming services. For this reason, there is a lively discussion of the Internet interconnection policy, which integrates various Internet service operators into one ecosystem. We conducted an Analytic Hierarchy Process(AHP) analysis with 16 experts in government/public, and academic sectors, and alternative selection criteria and their corresponding alternatives and detailed tasks were evaluated. According to the results, the most important alternative selection criteria was a "fair charge against foreign service operators", and the most desirable alternative was "partial revise". Moreover, the experts responded that "reassessment of the principle of the charge" is the most urgent task to improve the Internet interconnection policy.

The Hangul 4 State Bar Code System for the Automatic processing of Mail Items (우편물 자동처리를 위한 한글 4 State 바코드 시스템)

  • Park, Moon-Sung;Song, Jae-Gwan;Woo, Dong-Chin
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.1
    • /
    • pp.146-155
    • /
    • 2000
  • This paper describes a 4-state bar code called HANGUL 4 ST that has been specifically designed for automatic processing of the letter mails, A HANGUL 4 ST bar code is a necessary data base that is applied data capture and data carrier with it all the information necessary for sorting, the amount capture for transportation of mail items, and valued-added services such as indicia, tracking and trace. The 4-state bar code information contents are composed of a postal code, delivery point, customer information including customer identification number and name, and parity bits for error detect and correct. The data density capability of HANGUL 4 St allows all useful sorting data and customer data to be encoded on one label. This supports better automatic processing in mail items, higher level of customer service and more efficient operation.

  • PDF

A Traffic Equilibrium Model with Area-Based Non Additive Road Pricing Schemes (지역기반의 비가산성 도로통행료 부과에 따른 교통망 균형모형)

  • Jung, Jumlae
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.28 no.5D
    • /
    • pp.649-654
    • /
    • 2008
  • In the definition of non additive path, the sum of travel costs of links making up the path is not equal to the path cost. There are a variety of cases that non-additivity assumption does not hold in transportation fields. Nonetheless, traffic equilibrium models are generally built up on the fundamental hypothesis of additivity assumption. In this case traffic equilibrium models are only applicable within restrictive conditions of the path cost being linear functions of link cost. Area-wide road pricing is known as an example of realistic transportation situations, which violates such additivity assumption. Because travel fare is charged at the moment of driver's passing by exit gate while identified at entry gate, it may not be added linearly proportional to link costs. This research proposes a novel Wordrop type of traffic equilibrium model in terms of area-wide road pricing schemes. It introduces binary indicator variable for the sake of transforming non-additive path cost to additive. Since conventional shortest path and Frank-Wolfe algorithm can be applied without route enumeration and network representation is not required, it can be recognized more generalized model compared to the pre-proposed approaches. Theoretical proofs and case studies are demonstrated.

Progressive Iterative Forward and Backward (PIFAB) Search Method to Estimate Path-Travel Time on Freeways Using Toll Collection System Data (고속도로 경로통행시간 산출을 위한 전진반복 전후방탐색법(PIFAB)의 개발)

  • NamKoong, Seong
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.5 s.83
    • /
    • pp.147-155
    • /
    • 2005
  • The purpose of this paper is to develop a method for estimation of reliable path-travel time using data obtained from the toll collection system on freeways. The toll collection system records departure and arrival time stamps as well as the identification numbers of arrival and destination tollgates for all the individual vehicles traveling between tollgates on freeways. Two major issues reduce accuracy when estimating path-travel time between an origin and destination tollgate using transaction data collected by the toll collection system. First, travel time calculated by subtracting departure time from arrival time does not explain path-travel time from origin tollgate to destination tollgate when a variety of available paths exist between tollgates. Second, travel time may include extra time spent in service and/or rest areas. Moreover. ramp driving time is included because tollgates are installed before on-ramps and after off-ramps. This paper describes an algorithm that searches for arrival time when departure time is given between tollgates by a Progressive Iterative Forward and Backward (PIFAB) search method. The algorithm eventually produces actual path-travel times that exclude any time spent in service and/or rest areas as well as ramp driving time based on a link-based procedure.