• Title/Summary/Keyword: Ticket Gate ID

Search Result 2, Processing Time 0.017 seconds

A Study On Gateless Fare Collection System in the Subway Using RF-ID System (RF-ID 시스템을 이용한 지하철 무개찰 시스템에 대한 연구)

  • Kim, Hyun;Ryu, Hyoung-Sun;Jin, In-Su;Kim, Yang-Mo
    • Proceedings of the KIEE Conference
    • /
    • 2000.11d
    • /
    • pp.729-731
    • /
    • 2000
  • RF-ID system is being used in such diverse applications as access control, highway toll collection, personnel identification, and subway system. Especially for subway system that typically see high volumes of passenger at specific times of the days. it's critical to find a way to collect fares without unnecessarily delaying passengers. In the study, we discuss the possibility of removing all ticket gate machines in stations. This paper presents the discrimination method of card group for subway station without enter and exit gates using RF-ID system.

  • PDF

Link Label-Based Optimal Path Algorithm Considering Station Transfer Penalty - Focusing on A Smart Card Based Railway Network - (역사환승페널티를 고려한 링크표지기반 최적경로탐색 - 교통카드기반 철도네트워크를 중심으로 -)

  • Lee, Mee Young
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.38 no.6
    • /
    • pp.941-947
    • /
    • 2018
  • Station transfers for smart card based railway networks refer to transfer pedestrian movements that occur at the origin and destination nodes rather than at a middle station. To calculate the optimum path for the railway network, a penalty for transfer pedestrian movement must be included in addition to the cost of within-car transit time. However, the existing link label-based path searching method is constructed so that the station transfer penalty between two links is detected. As such, station transfer penalties that appear at the origin and destination stations are not adequately reflected, limiting the effectiveness of the model. A ghost node may be introduced to expand the network, to make up for the station transfer penalty, but has a pitfall in that the link label-based path algorithm will not hold up effectively. This research proposes an optimal path search algorithm to reflect station transfer penalties without resorting to enlargement of the existing network. To achieve this, a method for applying a directline transfer penalty by comparing Ticket Gate ID and the line of the link is proposed.