|
|
|
Title: TRANSIT VEHICLE-TYPE SCHEDULING PROBLEM
Accession Number: 00715524
Record Type: Component
Availability: Find a library where document is available Abstract: This work addressed the problem of how to allocate vehicles efficiently for carrying out all of the trips in a given transit timetable, in which each vehicle is assigned a chain of trips, some of which may be deadhead (empty) trips. The methodology presented takes into account the association between the characteristics of each trip (urban, peripheral, intercity, etc.) and its required vehicle type. The problem is based on given sets of trips and vehicle types, in which the categories are arranged in decreasing order of vehicle cost. Therefore, each trip can be carried out by its vehicle type, or by other types listed in priority order. This problem can be formularized as a cost-flow network problem with a nonpolynomial-hard complexity level. Thus, a heuristic algorithm was developed in this work on the basis of the deficit function theory. A real-life example is presented at the end of the paper to assess the methodology's effectiveness.
Supplemental Notes: This paper appears in Transportation Research Record No. 1503, Public Transportation 1995: Current Research in Operations. Distribution, posting, or copying of this PDF is strictly prohibited without written permission of the Transportation Research Board of the National Academy of Sciences. Unless otherwise indicated, all materials in this PDF are copyrighted by the National Academy of Sciences. Copyright © National Academy of Sciences. All rights reserved
Monograph Title: Monograph Accession #: 01399819
Language: English
Authors: Ceder, AvishaiPagination: p. 34-38
Publication Date: 1995
Serial: ISBN: 0309061652
Features: Figures
(2)
; References
(7)
TRT Terms: Uncontrolled Terms: Subject Areas: Finance; Highways; Operations and Traffic Management; Planning and Forecasting; Public Transportation
Files: TRIS, TRB
Created Date: Dec 29 1996 12:00AM
More Articles from this Serial Issue:
|
