Show simple item record

dc.contributor.advisorGeorge Kocur.en_US
dc.contributor.authorLau, Peter S. C. (Peter Shiu Cheung)en_US
dc.contributor.otherMassachusetts Institute of Technology. Dept. of Civil and Environmental Engineering.en_US
dc.coverage.spatiale-uk-enen_US
dc.date.accessioned2010-05-27T19:48:12Z
dc.date.available2010-05-27T19:48:12Z
dc.date.copyright2009en_US
dc.date.issued2009en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/55337
dc.descriptionThesis (S.M. in Transportation)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 2009.en_US
dc.descriptionIncludes bibliographical references (p. 192-193).en_US
dc.description.abstractThis thesis investigates the design of a fare engine which operates within the constraints of using contactless bankcards as a fare instrument, while satisfying the complex current and future fare requirements of Transport for London (TfL). A fare engine is a system which transforms user transactions at fare gates and validators into chargeable fares. Contactless bankcard fare payment differs from current fare smartcard systems by requiring a centralized fare engine. The proposed fare engine utilizes a data structure which maintains each user's journey history in three successive tiers of linked objects. This structure enables transactions to be correctly sequenced without a guarantee of in-order arrival of gate and validator transactions. A cleanup routine prevents the data structure from growing without bound as journey history accumulates. A dynamic journey linking mechanism allows the effect of inserted transactions to be propagated throughout the data structure and reflected in the affected journeys with near-constant time complexity. This ensures scalability while providing real-time feedback for customer service and payment authorization needs. A solution is devised for the coupling of arbitrary origin-destination fares with zonal period tickets. The paradigm of automatic ticket selection is introduced, overcoming the limitations of the existing capping algorithm used by TfL. Through the tracking of parallel fare scenarios, passengers are guaranteed a total fare no higher than if they had purchased the optimal period ticket for their usage profile. With the solutions proposed in this thesis, a contactless bankcard fare engine for TfL appears feasible.en_US
dc.description.statementofresponsibilityby Peter S.C. Lau.en_US
dc.format.extent201 p.en_US
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsM.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582en_US
dc.subjectCivil and Environmental Engineering.en_US
dc.titleDeveloping a contactless bankcard fare engine for Transport for Londonen_US
dc.typeThesisen_US
dc.description.degreeS.M.in Transportationen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Civil and Environmental Engineering
dc.identifier.oclc495803282en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record