English
Related papers

Related papers: Speed-up Heuristic for an On-Demand Ride-Pooling A…

200 papers

This paper presents a modeling and optimization framework to study congestion-aware ride-pooling Autonomous Mobility-on-Demand (AMoD) systems, whereby self-driving robotaxis are providing on-demand mobility, and users headed in the same…

Systems and Control · Electrical Eng. & Systems 2023-11-07 Fabio Paparella , Leonardo Pedroso , Theo Hofman , Mauro Salazar

Integrating demand-responsive mobility services with transit systems is recognized as a practical and effective strategy to mitigate their impact on traffic congestion and the environment. This study develops an efficient hybrid…

Optimization and Control · Mathematics 2025-12-04 Yumeng Fang , Tai-Yu Ma

By utilising vehicle capacity more efficiently, ride-pooling platforms can potentially lead to reduced congestion levels without adversely prolonging travel times. While previous studies concluded that shared rides can offer substantial…

Physics and Society · Physics 2021-07-15 Arjan de Ruijter , Oded Cats , Javier Alonso-Mora , Serge Hoogendoorn

We study the feasibility of using electric vehicles in online, high-capacity ridepooling systems. Prior work has shown that online algorithms perform well for centrally-controlled, high-capacity ridepool systems. First, we propose a mixed…

Systems and Control · Electrical Eng. & Systems 2021-01-06 Matthew Zalesak , Samitha Samaranayake

In autonomous Mobility on Demand (MOD) systems, customers request rides from a fleet of shared vehicles that can be automatically positioned in response to customer demand. Recent approaches to MOD systems have focused on environments where…

Robotics · Computer Science 2017-07-25 Justin Miller , Jonathan P. How

Shared rides are often considered to be a promising travel alternative that could efficiently pool people together while offering a door-to-door service. Notwithstanding, even though demand distribution patterns are expected to greatly…

Physics and Society · Physics 2024-09-17 Jaime Soza-Parra , Rafał Kucharski , Oded Cats

Ride-pooling systems, to succeed, must provide an attractive service, namely compensate perceived costs with an appealing price. However, because of a strong heterogeneity in a value-of-time, each traveller has his own acceptable price,…

Computer Science and Game Theory · Computer Science 2025-09-01 Michal Bujak , Rafal Kucharski

Ride-pooling (RP) service, as a form of shared mobility, enables multiple riders with similar itineraries to share the same vehicle and split the fee. This makes RP a promising on-demand feeder service for patrons with a common trip end in…

Networking and Internet Architecture · Computer Science 2024-11-05 Wenbo Fan , Xiaotian Yan , Zhanbo Sun , Xiaohui Yang

We consider the allocation of limited resources to heterogeneous customers who arrive in an online fashion. We would like to allocate the resources "fairly", so that no group of customers is marginalized in terms of their overall service…

Data Structures and Algorithms · Computer Science 2021-05-24 Will Ma , Pan Xu , Yifan Xu

On-demand ride-sharing is rapidly growing.Matching trip requests to vehicles efficiently is critical for the service quality of ride-sharing. To match trip requests with vehicles, a prune-and-select scheme is commonly used. The pruning…

Databases · Computer Science 2019-10-22 Yixin Xu , Jianzhong Qi , Renata Borovica-Gajic , Lars Kulik

This case-study aims at a comparison of the service quality of time-tabled buses as compared to on-demand ridepooling cabs in the late evening hours in the city of Wuppertal, Germany. To evaluate the service quality of ridepooling as…

Discrete Mathematics · Computer Science 2023-11-21 Hayk Asatryan , Daniela Gaul , Hanno Gottschalk , Kathrin Klamroth , Michael Stiglmayr

Edge computing hosts applications close to the end users and enables low-latency real-time applications. Modern applications inturn have adopted the microservices architecture which composes applications as loosely coupled smaller…

Networking and Internet Architecture · Computer Science 2021-11-02 Dhruv Garg , Nanjangud C. Narendra , Selome Tesfatsion

Computing shortest paths is one of the most researched topics in algorithm engineering. Currently available algorithms compute shortest paths in mere fractions of a second on continental sized road networks. In the presence of…

Data Structures and Algorithms · Computer Science 2014-08-01 Moritz Kobitzsch , Samitha Samaranayake , Dennis Schieferdecker

We present a new practical framework based on deep reinforcement learning and decision-time planning for real-world vehicle repositioning on ride-hailing (a type of mobility-on-demand, MoD) platforms. Our approach learns the spatiotemporal…

Machine Learning · Computer Science 2021-07-13 Yan Jiao , Xiaocheng Tang , Zhiwei Qin , Shuaiji Li , Fan Zhang , Hongtu Zhu , Jieping Ye

Matching demand (riders) to supply (drivers) efficiently is a fundamental problem for ride-sharing platforms who need to match the riders (almost) as soon as the request arrives with only partial knowledge about future ride requests. A…

Optimization and Control · Mathematics 2025-08-07 Omar El Housni , Vineet Goyal , Oussama Hanguir , Clifford Stein

In autonomous mobility-on-demand systems, effectively managing vehicle flows to mitigate induced congestion and ensure efficient operations is imperative for system performance and positive customer experience. Against this background, we…

Optimization and Control · Mathematics 2025-06-25 Antonio Coppola , Gerhard Hiermann , Dario Paccagnan , Maximilian Schiffer

For solving problems from the domain of Mobility-on-Demand (MoD), we often need to connect vehicle plans into plans spanning longer time, a process we call plan chaining. As we show in this work, chaining of the plans can be used to reduce…

Optimization and Control · Mathematics 2024-02-27 David Fiedler , Fabio V. Difonzo , Jan Mrkos

We formalize one aspect of reliability in the context of Mobility-on-Demand (MoD) systems by acknowledging the uncertainty in the pick-up time of these services. This study answers two key questions: i) how the difference between the stated…

General Economics · Economics 2019-04-18 Prateek Bansal , Yang Liu , Ricardo Daziano , Samitha Samaranayake

We introduce an improved algorithm for the dynamic taxi sharing problem, i.e. a dispatcher that schedules a fleet of shared taxis as it is used by services like UberXShare and Lyft Shared. We speed up the basic online algorithm that looks…

Data Structures and Algorithms · Computer Science 2023-11-06 Moritz Laupichler , Peter Sanders

Online ride-hailing platforms aim to deliver efficient mobility-on-demand services, often facing challenges in balancing dynamic and spatially heterogeneous supply and demand. Existing methods typically fall into two categories:…

Artificial Intelligence · Computer Science 2025-10-28 Yi Zhang , Yushen Long , Yun Ni , Liping Huang , Xiaohong Wang , Jun Liu