Title from PDF of title page. / Document formatted into pages; contains 92 pages. / Thesis (M.S.I.E.)--University of South Florida, 2003. / Includes bibliographical references. / Text (Electronic thesis) in PDF format. / ABSTRACT: In this research a heuristic algorithm is developed for searching and identifying preferred actions as applied to the bus route design problem. The search routine evaluates each subsequent segment added to the route in the context of the value of that segment and also the value of future decisions and opportunities for subsequent segments. The total overall maximum accessibility of the system is calculated using a minimum path network between each node pair and adding the accessibility of all route segments. This is equivalent to assuming that there was a direct shortest path route between every two destinations in the network. The quality of the designed network is obtained by comparing the share of the total benefits obtained from the heuristic with the share of the costs incurred with respect to a minimum path network. Several test cases and network scenarios are studied to evaluate the analytical tool developed. / ABSTRACT: In addition, different performance measures are used to identify the connecting routes that increase the accessibility of the system. / System requirements: World Wide Web browser and PDF reader. / Mode of access: World Wide Web.
| Identifer | oai:union.ndltd.org:USF/oai:palmm.fcla.edu:AJM5945SEB |
| Date | January 2003 |
| Creators | Iyer, Sandeep Seshan. |
| Publisher | University of South Florida |
| Source Sets | University of South Flordia |
| Detected Language | English |
Page generated in 0.0015 seconds