Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “paratransit”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

How Time Inefficient and Uncertain are Paratransit Trips Compared to Car Trips

The Americans with Disabilities Act (ADA) stipulates that paratransit mobility be comparable to public transit. However, with just under 5% of the population relying on public transportation, transit is not a representative benchmark. To highlight this inequality, we compare trip times by paratransit to counterfactual car-based travel. Using 2.5 years of demand data from the Denver Regional Transportation District's Access-a-Ride service, we compare paratransit trip times to counterfactual car-based trips for the same origin-destination pairs, controlling for various trip characteristics. Compared to car travel, the findings indicate high variability and uncertainty associated with paratransit trip times. For the same origin-destination pairs, the mean paratransit trip time is almost twice that of the mean car travel time, with a standard deviation for paratransit trip time fourfold that of the standard deviation for car trip time. For perspective, traveling an average of 10 mi during the 7-8 a.m. morning peak can take about 16 min by car with almost no variability, while that same trip can take an average of 25 min by paratransit, with 5% of trips being outside the 95% confidence interval and thus unpredictable. Paratransit trip time inefficiency tends to be particularly worse for females; older adults; those making trips between 9 and 11 a.m.; cash-paying customers; those making shorter trips; and those traveling during inclement weather, including cold temperatures. These findings suggest a need to re-assess using public transit as a benchmark for paratransit supply as regulated by the ADA.

accessible transportation and mobility↗

An Online Approach to Solve the Dynamic Vehicle Routing Problem with Stochastic Trip Requests for Paratransit Services

Many transit agencies operating paratransit and microtransit services have to respond to trip requests that arrive in real-time, which entails solving hard combinatorial and sequential decision-making problems under uncertainty. To avoid decisions that lead to significant inefficiency in the long term, vehicles should be allocated to requests by optimizing a non-myopic utility function or by batching requests together and optimizing a myopic utility function. While the former approach is typically offline, the latter can be performed online. We point out two major issues with such approaches when applied to paratransit services in practice. First, it is difficult to batch paratransit requests together as they are temporally sparse. Second, the environment in which transit agencies operate changes dynamically (e.g., traffic conditions can change over time), causing the estimates that are learned offline to become stale. To address these challenges, we propose a fully online approach to solve the dynamic vehicle routing problem (DVRP) with time windows and stochastic trip requests that is robust to changing environmental dynamics by construction. We focus on scenarios where requests are relatively sparse—our problem is motivated by applications to paratransit services. We formulate DVRP as a Markov decision process and use Monte Carlo tree search to evaluate actions for any given state. Accounting for stochastic requests while optimizing a non-myopic utility function is computationally challenging; indeed, the action space for such a problem is intractably large in practice. To tackle the large action space, we leverage the structure of the problem to design heuristics that can sample promising actions for the tree search. Our experiments using real-world data from our partner agency show that the proposed approach outperforms existing state-of-the-art approaches both in terms of performance and robustness.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Deploying Mobility-On-Demand for All by Optimizing Paratransit Services

While on-demand ride-sharing services have become popular in recent years, traditional on-demand transit services cannot be used by everyone, e.g., people who use wheelchairs. Paratransit services, operated by public transit agencies, are a critical infrastructure that offers door-to-door transportation assistance for individuals who face challenges in using standard transit routes. However, with declining ridership and mounting financial pressure, public transit agencies in the USA struggle to operate existing services. We collaborate with a public transit agency from the southern USA, highlight the specific nuances of paratransit optimization, and present a vehicle routing problem formulation for optimizing paratransit. We validate our approach using real-world data from the transit agency, present results from an actual pilot deployment of the proposed approach in the city, and show how the proposed approach comprehensively outperforms existing approaches used by the transit agency. To the best of our knowledge, this work presents one of the first examples of using open-source algorithmic approaches for paratransit optimization.

Pavia, Sophie↗

Mobility-On-Demand Transportation: A System for Microtransit and Paratransit Operations

New rideshare and shared-mobility services have transformed urban mobility in recent years. Therefore, transit agencies are looking for ways to adapt to this rapidly changing environment. In this space, ridepooling has the potential to improve efficiency and reduce costs by allowing users to share rides in high-capacity vehicles and vans. Most transit agencies already operate various ridepooling services including microtransit and paratransit. However, the objectives and constraints for implementing these services vary greatly between agencies. This brings multiple challenges. First, off-the-shelf ridepooling formulations must be adapted for real-world conditions and constraints. Second, the lack of modular and reusable software makes it hard to implement and evaluate new ridepooling algorithms and approaches in real-world settings. Therefore, we propose an on-demand transportation scheduling software for microtransit and paratransit services. This software is aimed at transit agencies looking to incorporate state-of-the-art rideshare and ridepooling algorithms in their everyday operations. We provide management software for dispatchers and mobile applications for drivers and users. Lastly, we discuss the challenges in adapting state-of-the-art methods to real-world operations.

Wilbur, Michael↗

SmartTransit.AI: A Dynamic Paratransit and Microtransit Application

New rideshare and shared mobility services have transformed urban mobility in recent years. Such services have the potential to improve efficiency and reduce costs by allowing users to share rides in high-capacity vehicles and vans. Most transit agencies already operate various ridepooling services, including microtransit and paratransit. However, the objectives and constraints for implementing these services vary greatly between agencies and can be challenging. First, off-the-shelf ridepooling formulations must be adapted for real-world conditions and constraints. Second, the lack of modular and reusable software makes it hard to implement and evaluate new ridepooling algorithms and approaches in real-world settings. We demonstrate a modular on-demand public transportation scheduling software for microtransit and paratransit services. The software is aimed at transit agencies looking to incorporate state-of-the-art rideshare and ridepooling algorithms in their everyday operations. We provide management software for dispatchers and mobile applications for drivers and users and conclude with results from the demonstration in Chattanooga, TN.

Pavia, Sophie↗

Rolling Horizon Based Temporal Decomposition for the Offline Pickup and Delivery Problem with Time Windows

The offline pickup and delivery problem with time windows (PDPTW) is a classical combinatorial optimization problem in the transportation community, which has proven to be very challenging computationally. Due to the complexity of the problem, practical problem instances can be solved only via heuristics, which trade-off solution quality for computational tractability. Among the various heuristics, a common strategy is problem decomposition, that is, the reduction of a large-scale problem into a collection of smaller sub-problems, with spatial and temporal decompositions being two natural approaches. While spatial decomposition has been successful in certain settings, effective temporal decomposition has been challenging due to the difficulty of stitching together the sub-problem solutions across the decomposition boundaries. In this work, we introduce a novel temporal decomposition scheme for solving a class of PDPTWs that have narrow time windows, for which it is able to provide both fast and high-quality solutions. We utilize techniques that have been popularized recently in the context of online dial-a-ride problems along with the general idea of rolling horizon optimization. To the best of our knowledge, this is the first attempt to solve offline PDPTWs using such an approach. To show the performance and scalability of our framework, we use the optimization of paratransit services as a motivating example. Due to the lack of benchmark solvers similar to ours (i.e., temporal decomposition with an online solver), we compare our results with an offline heuristic algorithm using Google OR-Tools. In smaller problem instances (with an average of 129 requests per instance), the baseline approach is as competitive as our framework. However, in larger problem instances (approximately 2,500 requests per instance), our framework is more scalable and can provide good solutions to problem instances of varying degrees of difficulty, while the baseline algorithm often fails to find a feasible solution within comparable compute times.

Kim, Youngseo↗

Recent tests on the Carter small reciprocating steam engines

The Jay Carter Enterprises (JCE) Paratransit Vehicle steam engine was tested over a range of conditions which might be experienced by the power converter subsystem of the Small Community Solar Thermal Power Experiment. Some difficulties were encountered getting the engine ready for testing. These difficulties were related to the five year dormancy of the entire system and to incomplete development work that had been going on at the time of cessation of steam engine work at JCE. Other difficulties were related to the fact that the particular expander being tested never ran before and possessed some manufacturing defects. Nevertheless, the engine was operated successfully and results of testing do verify results of computer simulations of the engine in regard to the effect of temperature and power level variations. Engine efficiency was good but generally lower than expected and performance dropped as testing continued. The effect of change in expansion ratio was not demonstrated because of deterioration in engine performance. Post-test inspection revealed numerous correctable defects.

Kiceniuk, T.↗

Automated Mobility Platforms: A Framework for Versatile, Energy-Efficient Urban Transportation for the 21st Century: Preprint

This paper presents automated mobility platforms (AMPs) as a framework to deliver high-quality urban mobility. AMPs leverage advances in sensing technology developed from automated roadway vehicles to provide opportunities for efficient movement of people and goods in dense urban environments, campuses, and large facilities like airports. In this paper, we layout the concept of AMPs and how they can serve the mobility needs of the population by providing service at the intersection of micromobility (services such as electric scooters or bikes), personal rapid transit, and moving walkways. Several key attributes and justification for the AMPs concept are described, including improvements to accessibility (inherent in design) covering both socioeconomic and disability equity, safety, energy efficiency, cost-effectiveness, urban land and space management, and scalability. We summarize the results from an ongoing national laboratory-sponsored, faculty-supported, student-led investigation into AMPs that includes stakeholder engagement and technical feasibility assessment.

ADVANCED PROPULSION SYSTEMS↗