<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-21T17:58:31Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/55337" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/55337</identifier><datestamp>2026-06-06T01:06:28Z</datestamp><setSpec>com_1721.1_7582</setSpec><setSpec>com_1721.1_7581</setSpec><setSpec>col_1721.1_131023</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor" lang="en_US">George Kocur.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Lau, Peter S. C. (Peter Shiu Cheung)</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="other" lang="en_US">Massachusetts Institute of Technology. Dept. of Civil and Environmental Engineering.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Massachusetts Institute of Technology. Department of Civil and Environmental Engineering</dim:field>
   <dim:field mdschema="dc" element="coverage" qualifier="spatial" lang="en_US">e-uk-en</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2010-05-27T19:48:12Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2010-05-27T19:48:12Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="copyright" lang="en_US">2009</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2009</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/1721.1/55337</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="oclc" lang="en_US">495803282</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Thesis (S.M. in Transportation)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 2009.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Includes bibliographical references (p. 192-193).</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">This 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.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="statementofresponsibility" lang="en_US">by Peter S.C. Lau.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">S.M. in Transportation</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent" lang="en_US">201 p.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">eng</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en_US">Massachusetts Institute of Technology</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en_US">M.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.</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri" lang="en_US">http://dspace.mit.edu/handle/1721.1/7582</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Civil and Environmental Engineering.</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Developing a contactless bankcard fare engine for Transport for London</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dspace" element="authorsordered">false</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="2fd61076-8437-4736-ab35-926f77a2c72b">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>eng&lt;/Language>
   	&lt;Title>Developing a contactless bankcard fare engine for Transport for London&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2009&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Lau, Peter S. C. (Peter Shiu Cheung)&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;DisplayName>Massachusetts Institute of Technology&lt;/DisplayName>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;License>http://dspace.mit.edu/handle/1721.1/7582&lt;/License>
    &lt;Keyword>Civil and Environmental Engineering.&lt;/Keyword>
   	&lt;Abstract>This 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&amp;apos;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.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>