The Dial-A-Ride Problem with Transfers

Abstract

The Dial-A-Ride Problem with Transfers (DARPT) consists in defining a set of routes that satisfy transportation requests of users between a set of pickup points and a set of delivery points, in the presence of ride time constraints. Users may change vehicles during their trip. This change of vehicle, called a transfer, is made at specific locations called transfer points. Solving the DARPT involves modeling and algorithmic difficulties. In this paper we provide a solution method based on an Adaptive Large Neighborhood Search (ALNS) metaheuristic and explain how to check the feasibility of a request insertion. The method is evaluated on real-life and generated instances. Experiments show that savings due to transfers can be up to 8% on real-life instances.

The pickup and delivery problem with time windows and scheduled lines

“…In another work, Masson et al (2012) introduce an adaptive large neighbourhood search (ALNS) algorithm to solve the PDP-T. Their results indicate savings of up to 9% in terms of travel time, obtained by using intermediate transfers. In addition, Masson et al (2014) propose an ALNS for the DARP with transfers (DARPT). The authors show that using transfers between vehicles may lead to significant savings in terms of operating costs (i.e.…”

An adaptive large neighborhood search heuristic for the Pickup and Delivery Problem with Time Windows and Scheduled Lines

“…Shang and Cuff [30] proposed an insertion heuristic algorithm to solve instances with up to 167 requests for the PDP-T. Cortes et al [7] proposed an exact decomposition method, namely Branch-and-Cut (B&C), and solved PDP-T instances with up to six requests. Moreover, Masson et al [22,23] proposed an ALNS to solve PDP-T and DARP-T, respectively. In both cases, the authors solved instances with up to 100 requests.…”

The integrated dial-a-ride problem with timetabled fixed route service

“…In contrast with the fixed transfer points in e.g. Masson et al (2014), the transfers in Deleplanque and Quilliot (2013) can occur anywhere. A problem similar to the DARPT is the pickup-and-delivery problem with transshipments (PDPT).…”

“…The main difference between the IDARP and DARPT is that the users change mode at the transfer points in the IDARP, and then travel a specified distance with the PT. In Masson et al (2014), an adaptive large neighborhood search method is used for solving the DARPT. It also describes the problem of how to check if a solution is feasible or not, and how this differs from how the feasibility is checked for a dial-a-ride service without transfers.…”