English
Related papers

Related papers: A Branch-and-Cut algorithm for an urban dial-a-rid…

200 papers

Accurately predicting the real-life performance of algorithms solving the Dial-a-Ride Problem (DARP) in the context of Mobility on Demand (MoD) systems with ridesharing requires evaluating them on representative instances. However, the…

Artificial Intelligence · Computer Science 2023-05-31 David Fiedler , Jan Mrkos

Ride-pooling, which accommodates multiple passenger requests in a single trip, has the potential to significantly increase fleet utilization in shared mobility platforms. The ride-pooling assignment problem finds optimal co-riders to…

Optimization and Control · Mathematics 2022-04-15 Qi Luo , Viswanath Nagarajan , Alexander Sundt , Yafeng Yin , John Vincent , Mehrdad Shahabi

In this paper, we consider the network slicing problem which attempts to map multiple customized virtual network requests (also called services) to a common shared network infrastructure and allocate network resources to meet diverse…

Networking and Internet Architecture · Computer Science 2021-02-05 Wei-Kun Chen , Ya-Feng Liu , Yu-Hong Dai , Zhi-Quan Luo

Original equipment manufacturers (OEMs) manufacture, inventory and transport new vehicles to franchised dealers. These franchised dealers inventory and sell new vehicles to end users. OEMs rely on logistics companies with a special type of…

Optimization and Control · Mathematics 2016-10-04 Saravanan Venkatachalam , Kaarthik Sundar

This paper addresses a new variant of the multi-trip single vehicle routing problem where the nodes are related to each other through AND-type precedence constraints. The problem aims at determining a sequence of trips to visit all the…

Optimization and Control · Mathematics 2021-06-04 Mina Roohnavazfar , Seyed Hamid Reza Pasandideh

Significant development of ride-sharing services presents a plethora of opportunities to transform urban mobility by providing personalized and convenient transportation while ensuring efficiency of large-scale ride pooling. However, a core…

Multiagent Systems · Computer Science 2021-06-15 Marina Haliem , Ganapathy Mani , Vaneet Aggarwal , Bharat Bhargava

We consider the open, non-preemptive online Dial-a-Ride problem on the real line, where transportation requests appear over time and need to be served by a single server. We give a lower bound of 2.0585 on the competitive ratio, which is…

Optimization and Control · Mathematics 2019-07-08 Alexander Birx , Yann Disser , Kevin Schewior

Rideshare and ride-pooling platforms use artificial intelligence-based matching algorithms to pair riders and drivers. However, these platforms can induce inequality either through an unequal income distribution or disparate treatment of…

Artificial Intelligence · Computer Science 2021-10-08 Naveen Raman , Sanket Shah , John Dickerson

Ride-sharing is an essential aspect of modern urban mobility. In this paper, we consider a classical problem in ride-sharing - the Multi-Vehicle Dial-a-Ride Problem (Multi-Vehicle DaRP). Given a fleet of vehicles with a fixed capacity…

Data Structures and Algorithms · Computer Science 2023-04-25 Kelin Luo , Alexandre M. Florio , Syamantak Das , Xiangyu Guo

On-demand ridepooling systems offer flexible services pooling multiple passengers into one vehicle, complementing traditional bus services. We propose a transportation system combining the spatial aspects of a fixed sequence of bus stops…

Optimization and Control · Mathematics 2025-09-25 Kendra Reiter , Marie Schmidt , Michael Stiglmayr

In a ride-pooling system, travellers experience discomfort associated with a detour and a longer travel time, which is compensated with a sharing discount. Most studies assume travellers receive either a flat discount or, in rare cases, a…

Computer Science and Game Theory · Computer Science 2024-11-07 Michal Bujak , Rafal Kucharski

Problem definition: To mitigate excessive crowding in public transit networks, network expansion is often not feasible due to financial and time constraints. Instead, operators are required to make use of existing infrastructure more…

Optimization and Control · Mathematics 2025-01-24 Yahan Lu , Rolf N. van Lieshout , Layla Martin , Lixing Yang

Branch-price-and-cut algorithms play an important role in solving many vehicle routing problems (VRPs). Adding valid inequalities in this framework can impact the pricing subproblem, for which the literature distinguishes between 'robust'…

Optimization and Control · Mathematics 2025-08-20 Ymro N. Hoogendoorn , Kevin Dalmeijer

This paper considers the vehicle routing problem with stochastic demands (VRPSD) under optimal restocking. We develop an exact algorithm that is effective for solving instances with many vehicles and few customers per route. In our…

Optimization and Control · Mathematics 2018-06-25 Alexandre Florio , Richard Hartl , Stefan Minner

This study presents a multi-zone queuing network model for steady-state ride-pooling operations that serve heterogeneous demand, and then builds upon this model to optimize the design of ride-pooling services. Spatial heterogeneity is…

Optimization and Control · Mathematics 2023-06-29 Yining Liu , Yanfeng Ouyang

Inventory management, vehicle routing, and delivery scheduling decisions are simultaneously considered in the context of the inventory routing problem. This paper focuses on the continuous-time version of this problem where, unlike its more…

Optimization and Control · Mathematics 2024-10-25 Akang Wang , Xiandong Li , Jeffrey E. Arbogast , Zachary Wilson , Chrysanthos E. Gounaris

Mobility-on-Demand (MoD) systems have become a fixture in urban transportation networks, with the rapid growth of ride-hailing services such as Uber and Lyft. Ride-hailing is typically complemented with ridepooling options, which can reduce…

Systems and Control · Electrical Eng. & Systems 2021-12-30 Yang Liu , Qi Luo , Raga Gopalakrishnan , Samitha Samaranayake

On-demand transport services in the form of dial-a-ride and taxis are crucial parts of the transport infrastructure in all major cities. However, not all on-demand transport services are equal. In particular, not-for-profit dial-a-ride…

Computers and Society · Computer Science 2015-01-08 Malcolm Egan , Michal Jakob

Autonomous mobility on demand services have the potential to disrupt the future mobility system landscape. Ridepooling services in particular can decrease land consumption and increase transportation efficiency by increasing the average…

Multiagent Systems · Computer Science 2022-07-12 Roman Engelhardt , Patrick Malcolm , Florian Dandl , Klaus Bogenberger

On-demand ride-pooling has emerged as a popular urban transportation solution, addressing the efficiency limitations of traditional ride-hailing services by grouping multiple riding requests with spatiotemporal proximity into a single…

Artificial Intelligence · Computer Science 2025-04-16 Matthew Zalesak , Hins Hu , Samitha Samaranayake