An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers

Masson, Renaud; Lehuédé, Fabien; Péton, Olivier

doi:10.1287/trsc.1120.0432

Cited by 164 publications

(98 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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.…”

Section: Introductionmentioning

confidence: 99%

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

Ghilas

Demir

2016

Computers & Operations Research

156

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 99%

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

Ghilas

Demir

2016

Computers & Operations Research

156

View full text Add to dashboard Cite

“…The algorithm is evaluated on instances with up to 25 requests. Masson et al [5] develop an ALNS for the PDPT. They present competitive results on the instances of Mitrović-Minić and Laporte and on real-life instances with up to 193 requests.…”

Section: Related Workmentioning

confidence: 99%

“…It was introduced by Pisinger and Ropke to solve a large variety of vehicle routing problems [29] including the Pickup and Delivery Problem with Time Windows [30]. It has been proven efficient for solving the PDPT [5].…”

Section: Physical Flow Of a Transfer Operationmentioning

confidence: 99%

“…Therefore constraints (12) and (13) are equivalent to constraints (3). Constraints (14) and (15) are equivalent to constraints (4) and (5). As a matter of fact, (FP' ) is a simple temporal problem which models the same feasibility problem as (FP ).…”

Section: Figure 4: Illustration Of the Interdependence Between Routesmentioning

confidence: 99%

“…We extend an Adaptive Large Neighborhood Search (ALNS) previously designed for the Pickup and Delivery Problem with Transfers (PDPT) [5]. We also integrate a preliminary study on feasibility algorithms for the DARPT [6].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

The Dial-A-Ride Problem with Transfers

Masson

Lehuédé

Péton

2014

Computers & Operations Research

Self Cite

131

View full text Add to dashboard Cite

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.

show abstract

The school bus routing and scheduling problem with transfers

2015

View full text Add to dashboard Cite

In this article, we study the school bus routing and scheduling problem with transfers arising in the field of nonperiodic public transportation systems. It deals with the transportation of pupils from home to their school in the morning taking the possibility that pupils may change buses into account. Allowing transfers has several consequences. On the one hand, it allows more flexibility in the bus network structure and can, therefore, help to reduce operating costs. On the other hand, transfers have an impact on the service level: the perceived service quality is lower due to the existence of transfers; however, at the same time, user ride times may be reduced and, thus, transfers may also have a positive impact on service quality. The main objective is the minimization of the total operating costs. We develop a heuristic solution framework to solve this problem and compare it with two solution concepts that do not consider transfers. The impact of transfers on the service level in terms of time loss (or user ride time) and the number of transfers is analyzed. Our results show that allowing transfers reduces total operating costs significantly while average and maximum user ride times are comparable to solutions without transfers. © 2015 Wiley Periodicals, Inc. NETWORKS, Vol. 65(2), 180–203 2015

show abstract

An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers

Abstract: International audienc

Cited by 164 publications

References 24 publications

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

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

The Dial-A-Ride Problem with Transfers

The school bus routing and scheduling problem with transfers

Contact Info

Product

Resources

About