2,260 research outputs found

    Data-driven Methodologies and Applications in Urban Mobility

    Get PDF
    The world is urbanizing at an unprecedented rate where urbanization goes from 39% in 1980 to 58% in 2019 (World Bank, 2019). This poses more and more transportation demand and pressure on the already at or over-capacity old transport infrastructure, especially in urban areas. Along the same timeline, more data generated as a byproduct of daily activity are being collected via the advancement of the internet of things, and computers are getting more and more powerful. These are shown by the statistics such as 90% of the world’s data is generated within the last two years and IBM’s computer is now processing at the speed of 120,000 GPS points per second. Thus, this dissertation discusses the challenges and opportunities arising from the growing demand for urban mobility, particularly in cities with outdated infrastructure, and how to capitalize on the unprecedented growth in data in solving these problems by ways of data-driven transportation-specific methodologies. The dissertation identifies three primary challenges and/or opportunities, which are (1) optimally locating dynamic wireless charging to promote the adoption of electric vehicles, (2) predicting dynamic traffic state using an enormously large dataset of taxi trips, and (3) improving the ride-hailing system with carpooling, smart dispatching, and preemptive repositioning. The dissertation presents potential solutions/methodologies that have become available only recently thanks to the extraordinary growth of data and computers with explosive power, and these methodologies are (1) bi-level optimization planning frameworks for locating dynamic wireless charging facilities, (2) Traffic Graph Convolutional Network for dynamic urban traffic state estimation, and (3) Graph Matching and Reinforcement Learning for the operation and management of mixed autonomous electric taxi fleets. These methodologies are then carefully calibrated, methodically scrutinized under various performance metrics and procedures, and validated with previous research and ground truth data, which is gathered directly from the real world. In order to bridge the gap between scientific discoveries and practical applications, the three methodologies are applied to the case study of (1) Montgomery County, MD, (2) the City of New York, and (3) the City of Chicago and from which, real-world implementation are suggested. This dissertation’s contribution via the provided methodologies, along with the continual increase in data, have the potential to significantly benefit urban mobility and work toward a sustainable transportation system

    Vehicle Dispatching and Routing of On-Demand Intercity Ride-Pooling Services: A Multi-Agent Hierarchical Reinforcement Learning Approach

    Full text link
    The integrated development of city clusters has given rise to an increasing demand for intercity travel. Intercity ride-pooling service exhibits considerable potential in upgrading traditional intercity bus services by implementing demand-responsive enhancements. Nevertheless, its online operations suffer the inherent complexities due to the coupling of vehicle resource allocation among cities and pooled-ride vehicle routing. To tackle these challenges, this study proposes a two-level framework designed to facilitate online fleet management. Specifically, a novel multi-agent feudal reinforcement learning model is proposed at the upper level of the framework to cooperatively assign idle vehicles to different intercity lines, while the lower level updates the routes of vehicles using an adaptive large neighborhood search heuristic. Numerical studies based on the realistic dataset of Xiamen and its surrounding cities in China show that the proposed framework effectively mitigates the supply and demand imbalances, and achieves significant improvement in both the average daily system profit and order fulfillment ratio

    Mobility on Demand in the United States

    Get PDF
    The growth of shared mobility services and enabling technologies, such as smartphone apps, is contributing to the commodification and aggregation of transportation services. This chapter reviews terms and definitions related to Mobility on Demand (MOD) and Mobility as a Service (MaaS), the mobility marketplace, stakeholders, and enablers. This chapter also reviews the U.S. Department of Transportation’s MOD Sandbox Program, including common opportunities and challenges, partnerships, and case studies for employing on-demand mobility pilots and programs. The chapter concludes with a discussion of vehicle automation and on-demand mobility including pilot projects and the potential transformative impacts of shared automated vehicles on parking, land use, and the built environment

    Operational research and simulation methods for autonomous ride-sourcing

    Get PDF
    Ride-sourcing platforms provide on-demand shared transport services by solving decision problems related to ride-matching and pricing. The anticipated commercialisation of autonomous vehicles could transform these platforms to fleet operators and broaden their decision-making by introducing problems such as fleet sizing and empty vehicle redistribution. These problems have been frequently represented in research using aggregated mathematical programs, and alternative practises such as agent-based models. In this context, this study is set at the intersection between operational research and simulation methods to solve the multitude of autonomous ride-sourcing problems. The study begins by providing a framework for building bespoke agent-based models for ride-sourcing fleets, derived from the principles of agent-based modelling theory, which is used to tackle the non-linear problem of minimum fleet size. The minimum fleet size problem is tackled by investigating the relationship of system parameters based on queuing theory principles and by deriving and validating a novel model for pickup wait times. Simulating the fleet function in different urban areas shows that ride-sourcing fleets operate queues with zero assignment times above the critical fleet size. The results also highlight that pickup wait times have a pivotal role in estimating the minimum fleet size in ride-sourcing operations, with agent-based modelling being a more reliable estimation method. The focus is then shifted to empty vehicle redistribution, where the omission of market structure and underlying customer acumen, compromises the effectiveness of existing models. As a solution, the vehicle redistribution problem is formulated as a non-linear convex minimum cost flow problem that accounts for the relationship of supply and demand of rides by assuming a customer discrete choice model and a market structure. An edge splitting algorithm is then introduced to solve a transformed convex minimum cost flow problem for vehicle redistribution. Results of simulated tests show that the redistribution algorithm can significantly decrease wait times and increase profits with a moderate increase in vehicle mileage. The study is concluded by considering the operational time-horizon decision problems of ride-matching and pricing at periods of peak travel demand. Combinatorial double auctions have been identified as a suitable alternative to surge pricing in research, as they maximise social welfare by relying on stated customer and driver valuations. However, a shortcoming of current models is the exclusion of trip detour effects in pricing estimates. The study formulates a shared-ride assignment and pricing algorithm using combinatorial double auctions to resolve the above problem. The model is reduced to the maximum weighted independent set problem, which is APX-hard. Therefore, a fast local search heuristic is proposed, producing solutions within 10\% of the exact approach for practical implementations.Open Acces
    • …
    corecore