TRB Pubsindex
Text Size:
x

« Prev Next »

Return to Results | New Search

Bookmark and Share

Title:

Dynamic Programming Strategies for Dial-a-Ride Problem with Time Window Constraints

Accession Number:

01020455

Record Type:

Component

Availability:

Transportation Research Board Business Office

500 Fifth Street, NW
Washington, DC 20001 United States

Abstract:

In this paper we present a new dynamic programming algorithm for the single and multi-vehicle dial a ride problem with time windows. The algorithm is based on a data structure implementation which is an extension of the one introduced by Psaraftis. We present the algorithm for the single vehicle case first and extend it to the multi-vehicle case. Then, we elaborate on its time and space requirements. The importance of the algorithm results from the fact that it can be used to improve the performance of existing heuristic techniques for the problem. We elaborate on the performance of the algorithm and the various ways it can be utilized. We conclude with suggestions for possible extensions of the present work.

Monograph Accession #:

01020180

Report/Paper Numbers:

06-3037

Language:

English

Corporate Authors:

Transportation Research Board

500 Fifth Street, NW
Washington, DC 20001 United States

Authors:

Ziliaskopoulos, Athanasios
Kozanidis, George

Pagination:

12p

Publication Date:

2006

Conference:

Transportation Research Board 85th Annual Meeting

Location: Washington DC, United States
Date: 2006-1-22 to 2006-1-26
Sponsors: Transportation Research Board

Media Type:

CD-ROM

Features:

References (24) ; Tables (1)

Subject Areas:

Public Transportation

Source Data:

Transportation Research Board Annual Meeting 2006 Paper #06-3037

Files:

BTRIS, TRIS, TRB

Created Date:

Mar 3 2006 11:12AM