Abstract
In the United States, many transit agencies are considering integrating their demand-responsive service with traditional fixed-route service. In some cases, it may be advantageous to the transit agency or to the passenger to coordinate traditional demand-responsive transit service with fixed-route service. The demand-responsive service connects passengers from their origin to the fixed route service and (or) from the fixed route service to their final destination. Such a service is expected to reduce the cost of transit service, but also will affect the level of service experienced by passengers. The integrated transit service problem is to schedule both passenger trips (or itineraries) and vehicle trips for this service. In considering the literature, this research proposes a scheduling method that explicitly incorporates both transit agency cost and passenger level of service. More specifically, the model assumes: (i) a fixed-route bus schedule; (ii) desired passenger pick-up and drop-off points; (iii) time window constraints for passenger pick-ups, drop-offs, and transfers; and (iv) passenger level of service constraints, including maximum travel times and number of transfers. Using this information, the proposed technique determines which trips are eligible for integrated service using the passenger level of service constraints. A schedule is then created for both the passenger trips and the vehicle trips, so that the total cost of service is minimized. The method is illustrated using a case study of transit service in Houston, Texas, showing the possible cost advantages and changes in passenger level of service with integrated service. The contributions of the research include: (i) a new heuristic for scheduling integrated transit trips that accommodates both passenger and vehicle scheduling objectives; and, (ii) an illustrated method for evaluating the operating cost and passenger level of service implications of integrated transit service.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
Balog, J., J. Morrison, and M. Hood (1997). Integration of paratransit and transit services: Importance of vehicle transfer requirements to consumers. Transportation Research Record 1571, 97–105.
Balog, J., A. Schwarz, J. Morrison, M. Hood, J. Maslanka, and J. Rimmer (1996). Guidebook for Attracting Paratransit Patrons to Fixed-Route Services. Technical Report 24, Transit Cooperative Research Program (TCRP), Transportation Research Board, Washington, DC.
Bander, J. and C.C. White (1991). A new route optimization algorithm for rapid decision support. In Proceedings of the Vehicle Navigation and Information Systems Conference, P-253, 2, 709–728.
Bovy, P.H.L. and E. Stern (1990). Route Choice: Wayfinding in Transport Networks. Kluwer, Dodrecht.
Crainic, T., F. Malucelli, M. Nonato, and S. Pallotino (1998). Heuristic approaches for flexible transit. In Proceedings of the 6th Meeting of the EURO Working Group on Transportation, Goteborg.
Desrochers, M. and F. Soumis (1988). A generalized permanent labelling algorithm for the shortest path problem with time windows. INFOR 26, 191–212.
Gerland, H. (1991). FOCCS: Flexible operation command and control system for public transport. Proceedings of Seminar H held at the PTRC 19th Summer Annual Meeting, P348, Sussex, 139–150.
Han, A. and C. Hwang (1992). Efficient search algorithms for route information services of direct and connecting transit trips. Transportation Research Record 1358, 1–5.
Hickman, M. and K. Blume (2001). Methods for Scheduling Integrated Transit Service: Survey of Current Methods and a New Heuristic. Technical report, Texas A&M University System, College Station. Draft Report for the Southwest Region University Transportation Center.
Horn, M. (1999). Planning Multi-leg Urban Journeys with Fixed-schedule and Demand-responsive Public Transport Services. Technical Report 99/62, CSIRO Mathematical and Information Sciences, Canberra.
Ioachim, I., J. Desrosiers, Y. Dumas, M. Solomon, and D. Villeneuve (1995). A request clustering algorithm for door-to-door handicapped transportation. Transportation Science 29, 63–78.
Jaw, J., A.R. Odoni, H.N. Psaraftis, and N.H.M. Wilson (1986). A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows. Transportation Research 20B, 243–257.
Kittelson and Inc. Associates (1999). Transit Capacity and Quality of Service Manual. Technical Report Web Document 6, Transit Cooperative Research Program (TCRP), Transportation Research Board, Washington, DC.
Koncz, N., J. Greenfeld, and K. Mouskos (1996). A strategy for solving static multiple-optimal-path transit network problems. Journal of Transportation Engineering 122, 218–225.
Liaw, C., C.C. White, and J. Bander (1996). A decision support system for the bimodal dial-a-ride problem. IEEE Transactions on Systems, Man, and Cybernetics — Part A: Systems and Humans 26, 552–565.
Malucelli, F., M. Nonato, T. Crainic, and F. Guertin (2001). Adaptive memory programming for a class of demand responsive transit systems. This volume.
Wilson, N.H.M., R.W. Weissburg, and J. Hauser (1976). Advanced Dial-aride Algorithms Research Project: Final Report. Technical report, Massachusetts Institute of Technology, Cambridge.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hickman, M., Blume, K. (2001). Modeling Cost and Passenger Level of Service for Integrated Transit Service. In: Voß, S., Daduna, J.R. (eds) Computer-Aided Scheduling of Public Transport. Lecture Notes in Economics and Mathematical Systems, vol 505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56423-9_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-56423-9_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42243-3
Online ISBN: 978-3-642-56423-9
eBook Packages: Springer Book Archive