dc.contributor.advisor | George Kocur. | en_US |
dc.contributor.author | Wang, Yin, Ph. D. Massachusetts Institute of Technology | en_US |
dc.contributor.other | Massachusetts Institute of Technology. Department of Civil and Environmental Engineering. | en_US |
dc.date.accessioned | 2014-09-19T21:38:11Z | |
dc.date.available | 2014-09-19T21:38:11Z | |
dc.date.copyright | 2014 | en_US |
dc.date.issued | 2014 | en_US |
dc.identifier.uri | http://hdl.handle.net/1721.1/90074 | |
dc.description | Thesis: S.M. in Transportation, Massachusetts Institute of Technology, Department of Civil and Environmental Engineering, 2014. | en_US |
dc.description | Cataloged from PDF version of thesis. | en_US |
dc.description | Includes bibliographical references (pages 89-91). | en_US |
dc.description.abstract | This thesis describes the design and implementation of the key parts of an open payment system that supports mobile phone ticketing for the Long Island Railroad (LIRR), a part of the New York Metropolitan Transportation Authority (MTA). While many public transit agencies across the world are still using traditional fare systems, open payment system can help reduce lifecycle costs for transit agencies while making public transit service more convenient to passengers. One of the keys to the implementation of an open payment fare system is to infer trips and compute fares from a series of taps on gates and fareboxes by an open payment device, either a bankcard or a mobile phone. A trip construction algorithm based on a finite state machine is proposed to automatically group tap events from a single user into trip segments according to the MTA's fare rules and send them to a fare engine for fare calculation. The trip construction algorithm (implemented in the trip server) can handle bus, subway and railroad tap events in the MTA's system with fraud detection and exception handling. The fare engine adapts a label-correcting shortest path algorithm to find the chosen paths for each trip segment and to calculate the fare based on the LIRR's fare structure, including a number of configuration parameters such as minimum fare, minimum transfers and minimum travel time. The shortest path algorithm runs on a directed graph that is capable of modeling LIRR's complex service and transfer restrictions. Recognizing the limitations of system-specific fare engine design, this thesis also proposes extensions to the General Transit Feed Specification (GTFS), and develops a generic fare engine design that can be shared across multiple transit systems. These extended designs are studied and tested on the LIRR and Transport for London (TfL) networks. The proposed design appears to accommodate the fare policies of many transit systems; eight systems are briefly reviewed. | en_US |
dc.description.statementofresponsibility | by Yin Wang. | en_US |
dc.format.extent | 91 pages | en_US |
dc.language.iso | eng | en_US |
dc.publisher | Massachusetts Institute of Technology | en_US |
dc.rights | 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. | en_US |
dc.rights.uri | http://dspace.mit.edu/handle/1721.1/7582 | en_US |
dc.subject | Civil and Environmental Engineering. | en_US |
dc.title | A study of open payment fare systems : system design, fare engine algorithm and GTFS extension | en_US |
dc.type | Thesis | en_US |
dc.description.degree | S.M. in Transportation | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Civil and Environmental Engineering | |
dc.identifier.oclc | 890141673 | en_US |