Open-source VRPLite Package for Vehicle Routing with Pickup and Delivery: A Path Finding Engine for Scheduled Transportation Systems

Abstract

Recently, automation, shared use, and electrification are viewed as the ''three revolutions'' in the future transportation sector, and the traditional scheduled public transit system will be greatly enhanced with flexible services and autonomous vehicle scheduling capabilities. Many emerging scheduled transportation applications include the fully automatic operation system in urban rail transit, joint line planning, and timetabling for high-speed rail as well as emerging self-driving vehicle dispatching. The vehicle routing problem (VRP) holds promise for seeking an optimal set of vehicle routes and schedules to meet customers' requirements and plays a vital role in optimizing services for feature scheduled transportation systems. Due to the difficulty of finding optimal solutions for large-scale instances, enormous research efforts have been dedicated to developing efficient algorithms, while our paper presents a unique perspective based on a timedependent and state-dependent path searching framework. An open-source and light-weight VRP with pickup and delivery with time windows (VRPPDTW) modeling package, namely VRPLite, has been developed in this research to provide a high-quality and computationally efficient solution engine for transportation on demand applications. This paper describes the space-time-state

A Mixed Integer Linear Programming Model for Rolling Stock Deadhead Routing before the Operation Period in an Urban Rail Transit Line

“…Second, the extension of the model to further consider the train timetable, including the deadheading timetable before the operation period and the whole operation day's timetable, can provide more systemwide benefits in practice [29]. ird, some new mathematical formulations and solution methods can be further developed by modeling the problem as a similar vehicle routing problem, which can accurately consider the dynamic boarding and alighting of passengers and the rolling stock seat capacity [30].…”

A Fast Approach for Reoptimization of Railway Train Platforming in Case of Train Delays

“…Second, the MILP model and the heuristic algorithm GSAHA proposed in this paper can be further developed to consider different station types, such as the terminal station where trains need to perform the turnaround movement that makes the train platforming problem more complicated [42,43]. ird, the train movements at the stations can be viewed as a set of space-time paths, and thus more efficient dual decomposition methods could be developed accordingly [7,44,45]. Fourth, more efficient solution algorithms can be developed for the simultaneous reoptimization of several interconnected railway stations in a railway line or even a regional railway network with more complicated structure so that the joint optimization of delay situations and train timetabling problems can be achieved [8,19,27,[46][47][48][49].…”

Development of an Algorithm for Optimal Demand Responsive Relocatable Feeder Transit Networks Serving Multiple Trains and Stations

“…These approaches include TS [30], SA [31], large neighborhood search (LNS) [32], and guided ejection search (GES) [33]. Recently, Zhou et al [34] developed an opensource lightweight approach to solve the vehicle routing problem pickup and delivery with time windows (VRPPDTW) using complex space-time-state network models, especially from a time-and state-dependent shortest-path perspective.…”