|
|
|
Title: DISCRETE OPTIMIZATION IN TRANSPORTATION NETWORKS
Accession Number: 00301611
Record Type: Component
Availability: Find a library where document is available Abstract: In most cases, planning capital investment in transportation networks is an unwieldy job because the number of investment options grows so rapidly. The real situation faced by the transportation planner is, in general, when, where, and by how much to allocate available resources. The transportation investment problem can be characterized as the location and timing decisions to be made by the planner. A branch-and-backtrack algorithm is presented that tackles both location and timing aspects of the capital investment problem in small and medium transportation networks. The results presented are encouraging for future research in which the technique can be applied to larger, actual transportation networks. /Author/
Supplemental Notes: Publication of this paper sponsored by Committee on Transportation Systems Design. 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 #: 01411054
Authors: Lago, Paolo A RPagination: pp 33-39
Publication Date: 1979
Serial: Conference:
58th Annual Meeting of the Transportation Research Board
Location:
Washington District of Columbia, United States ISBN: 0309029538
Media Type: Print
Features: Figures
(6)
; References; Tables
(5)
TRT Terms: Uncontrolled Terms: Geographic Terms: Old TRIS Terms: Subject Areas: Administration and Management; Economics; Finance; Highways; Planning and Forecasting; Policy; Public Transportation; Railroads; Society
Files: TRIS, TRB
Created Date: Nov 27 1981 12:00AM
More Articles from this Serial Issue:
|
