Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6892968 | Computers & Operations Research | 2014 | 12 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Renaud Masson, Fabien Lehuédé, Olivier Péton,