In the realm of vehicle routing problems (VRPs), there are two primary categories: offline VRPs and online VRPs. Offline VRPs involve pre-determined trip requests while online VRPs deal with real-time request arrivals. However, existing formulations fail to adequately address a specific real-world issue identified through consultations with public transit agencies: the need for booking trips with flexible pickup windows in advance and confirming tight pickup windows at the time of booking. This type of service model is crucial in paratransit service settings where passengers typically schedule trips over the phone for the following day. To bridge the gap between offline and online problems, a novel formulation known as the offline vehicle routing problem with online bookings has been introduced. This problem poses significant computational challenges as it must handle large sets of requests akin to offline VRPs while adhering to strict constraints on running time similar to online VRPs. To tackle this complex problem effectively, a unique computational approach has been proposed that combines an anytime algorithm with a learning-based policy for making real-time decisions. Drawing upon a dataset from the public transit agency of Chattanooga, TN, the efficacy of this novel formulation and computational approach has been demonstrated through empirical analysis. The results showcase that this innovative solution outperforms existing algorithms significantly in addressing the intricacies of paratransit service settings. The study conducted by authors Amutheezan Sivagnanam, Salah Uddin Kadir, Ayan Mukhopadhyay, Philip Pugliese, Abhishek Dubey, Samitha Samaranayake, and Aron Laszka sheds light on how advancements in problem formulation and computational strategies can lead to enhanced outcomes in optimizing vehicle routing processes within challenging operational environments like paratransit services.
- Vehicle routing problems (VRPs) categorized into offline VRPs and online VRPs
- Need for flexible pickup windows in advance and tight pickup windows at booking time in paratransit service settings
- Introduction of offline vehicle routing problem with online bookings to address the gap between offline and online problems
- Computational challenges in handling large request sets while adhering to strict constraints on running time
- Proposed unique computational approach combining anytime algorithm with learning-based policy for real-time decisions
- Empirical analysis using Chattanooga, TN public transit agency dataset demonstrating efficacy of novel formulation and computational approach
- Outperformance of existing algorithms in addressing intricacies of paratransit service settings
- Vehicle routing problems (VRPs) are about planning the best routes for vehicles to pick up and drop off things.
- There are offline VRPs where routes are planned in advance and online VRPs where routes are planned at the time of booking.
- Paratransit services need flexible pickup times before booking and strict pickup times when booking.
- A new problem combines offline route planning with online bookings to bridge the gap between offline and online issues.
- A special method using algorithms and learning helps make quick decisions for handling many requests efficiently.
Definitions
- Vehicle routing problems (VRPs): Planning the best routes for vehicles to reach multiple destinations efficiently.
- Offline VRPs: Planning routes in advance without considering real-time changes.
- Online VRPs: Planning routes at the time of booking, taking real-time factors into account.
- Paratransit service settings: Transportation services for people with disabilities or special needs that require flexible scheduling.
- Computational challenges: Difficulties related to solving complex problems using computers within specific constraints.
- Anytime algorithm: An algorithm that can provide solutions at any point in its execution, not just at completion.
- Learning-based policy: Using previous experiences or data to make decisions or take actions effectively.
- Empirical analysis: Studying real-world data or observations to draw conclusions or test hypotheses.
Introduction:
In the world of transportation, vehicle routing problems (VRPs) have been a topic of extensive research. VRPs involve optimizing routes for vehicles to efficiently serve a set of customers or locations. These problems can be broadly classified into two categories: offline VRPs and online VRPs. Offline VRPs deal with pre-determined trip requests while online VRPs handle real-time request arrivals. However, existing formulations fail to address a crucial issue in paratransit service settings where passengers schedule trips over the phone for the following day - the need for booking trips with flexible pickup windows in advance and confirming tight pickup windows at the time of booking.
The Study:
To bridge this gap between offline and online problems, a team of researchers from various institutions including Amutheezan Sivagnanam, Salah Uddin Kadir, Ayan Mukhopadhyay, Philip Pugliese, Abhishek Dubey, Samitha Samaranayake, and Aron Laszka conducted an empirical study titled "Offline Vehicle Routing Problem with Online Bookings: An Empirical Analysis". The study aimed to propose a novel formulation that addresses this specific issue in paratransit services and develop an effective computational approach to solve it.
The Novel Formulation:
The proposed formulation is known as the "offline vehicle routing problem with online bookings" (OVRP-OB). It combines elements from both offline and online VRPs by considering pre-determined trip requests along with real-time bookings. This unique formulation poses significant computational challenges as it must handle large sets of requests similar to offline VRPs while adhering to strict constraints on running time like online VRPs.
Computational Approach:
To tackle these challenges effectively, the authors proposed a computational approach that combines an anytime algorithm with a learning-based policy for making real-time decisions. The anytime algorithm allows for incremental improvements in solutions over time while adhering to the strict time constraints. The learning-based policy uses historical data to make real-time decisions, ensuring efficient and effective routing.
Empirical Analysis:
To demonstrate the efficacy of their proposed formulation and computational approach, the authors used a dataset from the public transit agency of Chattanooga, TN. The dataset included trip requests and vehicle locations for a period of one week. The results were compared with existing algorithms commonly used in offline VRPs and online VRPs.
Results:
The empirical analysis showed that the OVRP-OB formulation outperformed existing algorithms significantly in terms of solution quality and running time. It was able to handle large sets of requests while adhering to tight time constraints, making it suitable for paratransit service settings where passengers schedule trips over the phone for the following day.
Conclusion:
The study conducted by Sivagnanam et al. sheds light on how advancements in problem formulation and computational strategies can lead to enhanced outcomes in optimizing vehicle routing processes within challenging operational environments like paratransit services. Their proposed OVRP-OB formulation addresses a crucial issue faced by public transit agencies and provides an effective solution that outperforms existing algorithms. This research has significant implications for improving efficiency and customer satisfaction in paratransit services, highlighting the importance of continuously evolving problem formulations and computational approaches in transportation research.
