z-logo
open-access-imgOpen Access
Passenger trips analysis determined by processing validation data of the electronic tickets in public transport
Author(s) -
А. И. Фадеев,
S. Alhusseini
Publication year - 2021
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/1061/1/012001
Subject(s) - trips architecture , transfer (computing) , transport engineering , ticket , public transport , work (physics) , identification (biology) , computer science , advertising , operations research , business , engineering , computer security , mechanical engineering , biology , botany , parallel computing
Based on the set of trip-legs obtained by the algorithm described in our earlier work-trip-legs were sorted by their start or end time for each ticket- we managed to identify the set of passenger correspondence which consists of one or several trip-leg based on the analysis of the transfer conditions. Advanced and in-depth study of passenger correspondence is pivotal for solving transport-planning tasks and avoiding any mistake happened at some point at trip identification. In this work, we will process two matters: distribution transfers by time and identify short activities trips. This work shows that for a two-hour period of free transfer, the share of free trips will be about 17% of the total number of trips. In details, 12% of passengers per day will take one free trip and the share of passengers who will perform two or more free transfers is about 5% of trips. For a one-hour free transfer period the share of free transfer will be about 10%. Passengers with one free transfer will make about 8% of trips. Also, after identifying the short activities trips and dividing these trips into separate trips, the share of trip without transfer increased by 7%. The transfer factor decreased by 0.04.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here