13 research outputs found

    Metrics for Quantifying Shareability in Transportation Networks: The Maximum Network Flow Overlap Problem

    Full text link
    Cities around the world vary in terms of their transportation networks and travel demand patterns; these variations affect the viability of shared mobility services. This study proposes metrics to quantify the shareability of person-trips in a city, as a function of two inputs--the road network structure and origin-destination (OD) travel demand. The study first conceptualizes a fundamental shareability unit, 'flow overlap'. Flow overlap denotes, for a person-trip traversing a given path, the weighted (by link distance) average number of other trips sharing the links along the original person's path. The study extends this concept to the network level and formulates the Maximum Network Flow Overlap Problem (MNFLOP) to assign all OD trips to paths that maximize network-wide flow overlap. The study utilizes the MNFLOP output to calculate metrics of shareability at various levels of aggregation: person-trip level, OD level, origin or destination level, network level, and link level. The study applies the MNFLOP and associated shareability metrics to different OD demand scenarios in the Sioux Falls network. The computational results verify that (i) MNFLOP assigns person-trips to paths such that flow overlaps significantly increase relative to shortest path assignment, (ii) MNFLOP and its associated shareability metrics can meaningfully differentiate between different OD trip matrices in terms of shareability, and (iii) an MNFLOP-based metric can quantify demand dispersion--a metric of the directionality of demand--in addition to the magnitude of demand, for trips originating or terminating from a single node in the network. The paper also includes an extensive discussion of potential future uses of the MNFLOP and its associated shareability metrics

    Dynamic Modeling and Real-time Management of a System of EV Fast-charging Stations

    Full text link
    Demand for electric vehicles (EVs), and thus EV charging, has steadily increased over the last decade. However, there is limited fast-charging infrastructure in most parts of the world to support EV travel, especially long-distance trips. The goal of this study is to develop a stochastic dynamic simulation modeling framework of a regional system of EV fast-charging stations for real-time management and strategic planning (i.e., capacity allocation) purposes. To model EV user behavior, specifically fast-charging station choices, the framework incorporates a multinomial logit station choice model that considers charging prices, expected wait times, and detour distances. To capture the dynamics of supply and demand at each fast-charging station, the framework incorporates a multi-server queueing model in the simulation. The study assumes that multiple fast-charging stations are managed by a single entity and that the demand for these stations are interrelated. To manage the system of stations, the study proposes and tests dynamic demand-responsive price adjustment (DDRPA) schemes based on station queue lengths. The study applies the modeling framework to a system of EV fast-charging stations in Southern California. The results indicate that DDRPA strategies are an effective mechanism to balance charging demand across fast-charging stations. Specifically, compared to the no DDRPA scheme case, the quadratic DDRPA scheme reduces average wait time by 26%, increases charging station revenue (and user costs) by 5.8%, while, most importantly, increasing social welfare by 2.7% in the base scenario. Moreover, the study also illustrates that the modeling framework can evaluate the allocation of EV fast-charging station capacity, to identify stations that require additional chargers and areas that would benefit from additional fast-charging stations

    Non-myopic Pathfinding for Shared-Ride Vehicles: A Bi-Criteria Best-Path Approach Considering Travel Time and Proximity to Demand [Research Brief]

    Get PDF
    USDOT Grant 69A3551747109Caltrans contract 65A06The overarching goal of this research project is to improve the operational efficiency of shared-ride mobility-on-demand services (SRMoDS) like UberPool and Lyft Line, in order to increase vehicle occupancies and decrease vehicle mileage. To meet this goal, the objective of this study is to develop a network pathfinding algorithm that considers both a network path\u2019s travel time and its proximity to potential future demand (i.e., travel requests), as opposed to a conventional shortest path algorithm that solely considers travel time
    corecore