Offline Vehicle Routing Problem with Online Bookings: A Novel Problem Formulation with Applications to Paratransit

04/25/2022
by   Amutheezan Sivagnanam, et al.
0

Vehicle routing problems (VRPs) can be divided into two major categories: offline VRPs, which consider a given set of trip requests to be served, and online VRPs, which consider requests as they arrive in real-time. Based on discussions with public transit agencies, we identify a real-world problem that is not addressed by existing formulations: booking trips with flexible pickup windows (e.g., 3 hours) in advance (e.g., the day before) and confirming tight pickup windows (e.g., 30 minutes) at the time of booking. Such a service model is often required in paratransit service settings, where passengers typically book trips for the next day over the phone. To address this gap between offline and online problems, we introduce a novel formulation, the offline vehicle routing problem with online bookings. This problem is very challenging computationally since it faces the complexity of considering large sets of requests – similar to offline VRPs – but must abide by strict constraints on running time – similar to online VRPs. To solve this problem, we propose a novel computational approach, which combines an anytime algorithm with a learning-based policy for real-time decisions. Based on a paratransit dataset obtained from our partner transit agency, we demonstrate that our novel formulation and computational approach lead to significantly better outcomes in this service setting than existing algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/28/2022

An Online Approach to Solve the Dynamic Vehicle Routing Problem with Stochastic Trip Requests for Paratransit Services

Many transit agencies operating paratransit and microtransit services ha...
research
04/06/2017

Tackling Dynamic Vehicle Routing Problem with Time Windows by means of Ant Colony System

The Dynamic Vehicle Routing Problem with Time Windows (DVRPTW) is an ext...
research
04/04/2023

Online Time-Windows TSP with Predictions

In the Time-Windows TSP (TW-TSP) we are given requests at different loca...
research
04/03/2023

Combinatorial Optimization enriched Machine Learning to solve the Dynamic Vehicle Routing Problem with Time Windows

With the rise of e-commerce and increasing customer requirements, logist...
research
12/04/2017

On the Real-time Vehicle Placement Problem

Motivated by ride-sharing platforms' efforts to reduce their riders' wai...
research
08/21/2023

Pseudo-online framework for BCI evaluation: A MOABB perspective

Objective: BCI (Brain-Computer Interface) technology operates in three m...
research
06/15/2020

Dynamic Vehicle Routing Problem: A Monte Carlo approach

In this work we solve the Dynamic Vehicle Routing Problem (DVRP). DVRP i...

Please sign up or login with your details

Forgot password? Click here to reset