|
Title: Model and Algorithm Considering Time-Varying Travel Times to Solve Static Multidepot Dial-a-Ride Problem
Accession Number: 01334198
Record Type: Component
Record URL: Availability: Transportation Research Board Business Office 500 Fifth Street, NW Find a library where document is available Abstract: This paper studies a static dial-a-ride problem (DARP) with time-varying travel times, soft time windows, and multiple depots. A static DARP model is formulated as a mixed-integer programming problem. To validate the model, several random small network problems are solved by using the commercial optimization package CPLEX. Three heuristic algorithms based on sequential insertion, parallel insertion, and clustering first–routing second are proposed to solve this problem within a reasonable time for implementation in a real-world situation. The results of the three heuristic methods are compared with the results obtained from exact solution by CPLEX to validate and evaluate the three heuristic algorithms. Computational results show that the three heuristic algorithms are superior to the exact algorithm in relation to the calculation time as the problem size (in number of demands) increases. Of the three heuristic algorithms, the one based on sequential insertion is more efficient than the other heuristic algorithms based on parallel insertion and clustering first–routing second.
Monograph Title: Monograph Accession #: 01355106
Report/Paper Numbers: 11-0637
Language: English
Authors: Kim, TaehyeongHaghani, AliPagination: pp 68-77
Publication Date: 2011
ISBN: 9780309167406
Media Type: Print
Features: Figures
(3)
; References
(19)
; Tables
(5)
TRT Terms: Subject Areas: Planning and Forecasting; Public Transportation; I72: Traffic and Transport Planning
Files: TRIS, TRB, ATRI
Created Date: Feb 17 2011 5:31PM
More Articles from this Serial Issue:
|