Search

USDOT Grant 69A3551747114, National Transportation Library (NTL) Curation Note: As this dataset is preserved in a repository outside U.S. DOT control, as allowed by the U.S. DOT’s Public Access Plan (https://doi.org/10.21949/1503647) Section 7.4.2 Data, the NTL staff has performed NO additional curation actions on this dataset. The current level of dataset documentation is the responsibility of the dataset creator. NTL staff last accessed this dataset at its repository URL on 2023-07-27. If, in the future, you have trouble accessing this dataset at the host repository, please email NTLDataCurator@dot.gov describing your problem. NTL staff will do its best to assist you at that time., In major metropolitan areas such as Los Angeles County, ride-sharing systems can help reduce traffic congestion and increase the efficiency of the transportation system. This research project proposes three different solution approaches for solving the ride share routing problem with flexible pickup and drop-off points. The first is a dynamic programming-based route enumeration procedure that can be used to solve small-sized problems; the other two are branch and price-based heuristics for solving large problems. The researchers first provide a mixed integer nonlinear model for routing and pickup and drop-off points selection which they later decompose into a master and subproblem for solving. To validate the performance of their approaches and gather valuable insights about the ridesharing system, the researchers perform numerical experiments on a San Francisco Taxicab dataset. Results show that the approaches are efficient, solving instances with up to 300 nodes within 130 CPU seconds. For these datasets, incorporating flexible meeting points (i.e., pickup and drop-off points) can reduce the total travel time of the rideshare system by 18%. Sensitivity analysis shows that it can also decrease the time passengers wait time for rides by 43%. The methodologies in this study can help transportation planners design more efficient rideshare systems with less waiting, better passenger service, and less travel time., The total size of the described file is 57.5 MB. A TAB file is a tabular data file that can be opened using open source programs such as Notepad or other open source, tabular file readers. Files with the .xlsx extension are Microsoft Excel spreadsheet files. These can be opened in Excel or open-source spreadsheet programs.

69A3551747114, Traffic congestion is a significant problem in major metropolitan areas in the United States. According to the Urban Mobility Report, in 2019 commuters on average lost about 54 hours in traffic congestion. To combat this, major infrastructure projects have been undertaken. However, expansion projects cannot keep up with the increase in usage of personal vehicles and thus fail to address the traffic congestion problem. Carpool ridesharing has shown some promise in combatting this traffic congestion problem. In this system, the drivers are regular commuters who take detours to pick up and drop off passengers to decrease their transportation costs. This system increases the efficiency of the transportation system by providing flexible commutes to people, thus reducing the need for each commuter to use their own personal vehicle. The researchers developed three approaches to rideshare routing. The researchers conducted a computational study using a San Francisco taxicab dataset to determine the effectiveness of the three approaches. To show the impact of flexible meeting points, the researchers also conducted experimental simulations with and without walking and performed sensitivity analyses.

USDOT Grant 69A3551747114, In major metropolitan areas such as Los Angeles County, ride-sharing systems can help reduce traffic congestion and increase the efficiency of the transportation system. This research project proposes three different solution approaches for solving the ride share routing problem with flexible pickup and drop-off points. The first is a dynamic programming-based route enumeration procedure that can be used to solve small-sized problems; the other two are branch and price-based heuristics for solving large problems. The researchers first provide a mixed integer nonlinear model for routing and pickup and drop-off points selection which they later decompose into a master and subproblem for solving. To validate the performance of their approaches and gather valuable insights about the ridesharing system, the researchers perform numerical experiments on a San Francisco Taxicab dataset. Results show that the approaches are efficient, solving instances with up to 300 nodes within 130 CPU seconds. For these datasets, incorporating flexible meeting points (i.e., pickup and drop-off points) can reduce the total travel time of the rideshare system by 18%. Sensitivity analysis shows that it can also decrease the time passengers wait time for rides by 43%. The methodologies in this study can help transportation planners design more efficient rideshare systems with less waiting, better passenger service, and less travel time.

69A3551747114, Ridesharing can help reduce traffic congestion, greenhouse gas emissions and increase accessibility to transportation in major metropolitan areas across the United States. A robust rideshare system needs to take uncertainties such as traffic congestion and passenger cancellations into account. In this report, the authors propose a data-driven stochastic rideshare system that integrates those sources of uncertainties. Instead of assuming a probability distribution, the approach learns the underlying distribution in travel times and passenger cancellations from historical data. The authors first provide a mathematical model of the problem. Later they propose a stochastic average approximation approach for solving the routing and flexible pickup and drop-off selection problem. They also propose a Branch-and-Price heuristic and Adaptive Large Neighborhood Search-based metaheuristic to solve the underlying rideshare routing problem. To validate the approach, the authors construct test cases based on the New York City taxicab dataset. Numerical results show that the proposed branch and price-based solution approach can efficiently solve small instances while being close to the true optimum. On the other hand, the ALNS-based approach can solve medium to large instances with a small computational time budget while being robust to uncertainties. The proposed approach can help transportation officials and rideshare planners design more robust rideshare systems to alleviate traffic congestion in California.