2026-09-18T22:13:01Zhttps://api.drum.lib.umd.edu/server/oai/request

oai:drum.lib.umd.edu:1903/213192018-09-14T02:37:44Zcom_1903_2221com_1903_1654com_1903_2col_1903_2753col_1903_3

Haghani, Ali Hao, Yeming Digital Repository at the University of Maryland University of Maryland (College Park, Md.) Civil Engineering 2018-09-13T05:31:32Z 2018-09-13T05:31:32Z 2018 https://doi.org/10.13016/M2W37M00V http://hdl.handle.net/1903/21319 This thesis proposes an integer programming model for Dynamic Taxi-Sharing (DTS), which allows two groups of taxi users to ride on the same taxi together. The model matches taxi drivers and user pairs in certain sequences with the goal of maximizing taxi providers’ profit. We also develop a DTS fare calculation scheme which can automatically calculate the fare for each DTS user and self-adjust to balance the taxi occupancy rate in real time. A customized spectral clustering approach for preselection on DTS trips is also designed to narrow down the search space for the model. Real-world taxi trip data is used to demonstrate the DTS system is beneficial to providers, taxi users, and taxi drivers. en AN INTEGER PROGRAMMING MODEL FOR DYNAMIC TAXI-SHARING CONSIDERING PROVIDER PROFIT Thesis Transportation Civil engineering clustering dynamic taxi sharing integer programming ridesharing taxi sharing open.access