Search NASA⌕ Search

Engineering topics

Suarez, Juan

Publications and source records attributed to Suarez, Juan.

An agent-based deployment decision-support system for electric vehicle services

METS-R ADDSEVS simulator is a high fidelity, parallel, agent-based evacuation simulator for multi-modal energy-optimal trip scheduling in real-time (METS-R) at transportation hubs. It consists of two modules. The first one is the traffic simulator module; the second one is the high-performance computing (HPC) module. More details can be found at https://umnilab.github.io/METS-R_doc/.

Lei, Zengxiang↗

Demand-adaptive Transit Design for Urban Transportation Hubs

In this study, we proposed a novel three-stage framework for planning the optimal demand-adaptive transit (DAT) at urban transportation hubs. Given the potential trip demand and road traffic condition, the proposed framework sequentially generates the optimal set of candidate routes, combines the outgoing routes and incoming routes at the hub, and derives the optimal fleet size and corresponding route frequency under the fixed budget. In particular, we build the route generation algorithm which maximizes passenger demand coverage with travel time deviation constraint. And a heuristic algorithm is further developed which yields near-optimal operation routes for real-time demand. The fleet optimization problem is formulated to minimize the weighted cost of energy savings, operation cost and trip revenue. We conduct comprehensive numerical experiments for planning DAT with electric buses at JFK airport in NYC using NYC taxi and for-hire vehicle trip data and GoogleMap speed data. The results show the superior performance of the proposed route generation algorithm which is able to cover citywide passenger demand with only 61 DAT routes. The results also suggest that the proposed DAT planning framework may serve over 47% of existing taxi and FHV demand by operating 18 routes using the fleet of 62 electric buses.

demand adaptive↗

Online Energy-optimal Routing for Electric Vehicles with Combinatorial Multi-arm Semi-Bandit

We have seen a rapid growth in the adoption of electric vehicle in today’s commercial mobility service market, from carrying passengers to the delivery of goods. One cardinal issue concerning the operation of EVs is the optimal routing of EV fleets with limited battery capacity. In this study, we investigate the energy-optimal online routing problem for the fleet of EVs, which focuses on identifying real-time minimum electricity consumption paths (MECP) for multiple OD pairs with limited information. We develop a multi-OD combinatorial multi-arm semi-bandit model (MCMAB) that uses the fleet of EVs as sensors in the transportation network and promotes the utilization of common information shared by different OD pairs. We further enrich the model with the path elimination policy to obtain MECP of high confidence while significantly reducing the number of learning iterations and the number of explorations needed. We demonstrate the effectiveness of the MCMAB and the efficiency of the path elimination policy with comprehensive numerical experiments in Manhattan, NYC. The results show that the proposed online routing algorithms can achieve near-optimal MECPs efficiently, and the quality of the solutions is significantly better than using the shortest travel time paths as approximate MECPs.

Chen, Xiaowei↗