Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Solution of the Dial‐a‐Ride Problem with multi‐dimensional capacity constraints

Solution of the Dial‐a‐Ride Problem with multi‐dimensional capacity constraints The Dial‐a‐Ride Problem (DARP) consists of planning routes and schedules for picking up and delivering users within user‐specified time windows. Vehicles of a given fleet with limited capacity depart from and end at a common depot. The travel time of passengers cannot exceed a given multiple of the minimum ride time. Other constraints include vehicle capacity and vehicle route duration. In practice, scheduling is made more complicated by special user requirements and an inhomogeneous vehicle fleet. The transportation of elderly and handicapped people is an important example, as space for wheelchairs is limited and a lift is required. In this study, we present a modified insertion heuristic to solve the DARP with multi‐dimensional capacity constraints, and the performance of the proposed algorithm is tested in simulation. We show that the proposed methodology is effective when compared with the classic algorithms. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Transactions in Operational Research Wiley

Solution of the Dial‐a‐Ride Problem with multi‐dimensional capacity constraints

Loading next page...
 
/lp/wiley/solution-of-the-dial-a-ride-problem-with-multi-dimensional-capacity-nSGM2fKOMq

References (16)

Publisher
Wiley
Copyright
Copyright © 2006 Wiley Subscription Services, Inc., A Wiley Company
ISSN
0969-6016
eISSN
1475-3995
DOI
10.1111/j.1475-3995.2006.00544.x
Publisher site
See Article on Publisher Site

Abstract

The Dial‐a‐Ride Problem (DARP) consists of planning routes and schedules for picking up and delivering users within user‐specified time windows. Vehicles of a given fleet with limited capacity depart from and end at a common depot. The travel time of passengers cannot exceed a given multiple of the minimum ride time. Other constraints include vehicle capacity and vehicle route duration. In practice, scheduling is made more complicated by special user requirements and an inhomogeneous vehicle fleet. The transportation of elderly and handicapped people is an important example, as space for wheelchairs is limited and a lift is required. In this study, we present a modified insertion heuristic to solve the DARP with multi‐dimensional capacity constraints, and the performance of the proposed algorithm is tested in simulation. We show that the proposed methodology is effective when compared with the classic algorithms.

Journal

International Transactions in Operational ResearchWiley

Published: May 1, 2006

There are no references for this article.