Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Public Affairs, Public Policy and Public Administration

PDF

Research Collection School Of Computing and Information Systems

Series

Assignment problems

Articles 1 - 1 of 1

Full-Text Articles in Engineering

Neural Approximate Dynamic Programming For On-Demand Ride-Pooling, Sanket Shah, Meghna Lowalekar, Pradeep Varakantham Feb 2020

Neural Approximate Dynamic Programming For On-Demand Ride-Pooling, Sanket Shah, Meghna Lowalekar, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

On-demand ride-pooling (e.g., UberPool, LyftLine, GrabShare) has recently become popular because of its ability to lower costs for passengers while simultaneously increasing revenue for drivers and aggregation companies (e.g., Uber). Unlike in Taxi on Demand (ToD) services – where a vehicle is assigned one passenger at a time – in on-demand ride-pooling, each vehicle must simultaneously serve multiple passengers with heterogeneous origin and destination pairs without violating any quality constraints. To ensure near real-time response, existing solutions to the real-time ride-pooling problem are myopic in that they optimise the objective (e.g., maximise the number of passengers served) for the current …