Skip navigation
Please use this identifier to cite or link to this item: http://arks.princeton.edu/ark:/88435/dsp010k225d80q
Title: A National Parallelized Hybrid Activity/Agent-Based Demand Model to Characterize the Mobility of the United States
Authors: Marocchini, Kyle
Advisors: Kornhauser, Alain
Department: Operations Research and Financial Engineering
Certificate Program: Center for Statistics and Machine Learning
Class Year: 2018
Abstract: The rise of emerging passenger-oriented mobility services, ranging from public multi-modal transportation systems to privately operated fleets of driverless vehicles, have the potential to completely revolutionize the current state of transportation throughout the world. To effectively and efficiently develop and implement these systems necessitates understanding the demand for transportation from both spatial and temporal lenses. Significant progress has been made in developing an activity-based model that generates a synthetic population complete with transportation needs, both spatial and temporal, disaggregated down to the individual level to provide a complete view of what a population’s daily transportation needs might look like on a typical day. However, computational issues continue to impede the development and extension of this model. Modelling the billion trips taken by over 300 million citizens on a typical workday requires significant computational power and by extension, processing time. Most of the model's processing time is due to the large number of sequential modelling algorithms throughout the model. These sequential algorithms use a single processor to process a queue of tasks, one at a time, in a specified order. However, in many cases throughout the model, the ordering of this queue of tasks does not matter. Thus, each task can be run independently of the other tasks in the queue. By using parallel algorithms, whereby the queue of tasks is split up and run simultaneously, a significant reduction in processing time can be accomplished by simply increasing the number of processors working on the queue of tasks. This work seeks to analyze and understand the implications of implementing parallelized versions of the existing sequential algorithms within the model, especially with regards to the overall processing time.
URI: http://arks.princeton.edu/ark:/88435/dsp010k225d80q
Type of Material: Princeton University Senior Theses
Language: en
Appears in Collections:Operations Research and Financial Engineering, 2000-2023

Files in This Item:
File Description SizeFormat 
MAROCCHINI-KYLE-THESIS.pdf3.34 MBAdobe PDF    Request a copy


Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.