IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v12y1978i3p232-249.html
   My bibliography  Save this article

Scheduling Dial-a-Ride Transportation Systems

Author

Listed:
  • David M. Stein

    (IBM T. J. Watson Research Center, Yorktown Heights, New York)

Abstract

An analytic investigation into the fundamental aspects of scheduling “Dial-a-Ride” transportation systems is conducted. Based upon simple mathematical models that focus on the combinatorial nature of the problem, a class of algorithms is derived for which performance can be measured in a precise asymptotic probabilistic sense. The approach yields many qualitative insights and the resulting transportation schemes have many attractive practical features. For example, they have modest computational requirements, are decentralized, and are easy to visualize and implement.

Suggested Citation

  • David M. Stein, 1978. "Scheduling Dial-a-Ride Transportation Systems," Transportation Science, INFORMS, vol. 12(3), pages 232-249, August.
    • Handle: RePEc:inm:ortrsc:v:12:y:1978:i:3:p:232-249
    DOI: 10.1287/trsc.12.3.232
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.12.3.232
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.12.3.232?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Khattak, Asad J. & Yim, Youngbin, 2003. "Traveler Response to Innovative Personalized Demand-Responsive Transit in the San Francisco Bay Area," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt5j3845mz, Institute of Transportation Studies, UC Berkeley.
    2. Zhao, Jiamin & Dessouky, Maged, 2008. "Service capacity design problems for mobility allowance shuttle transit systems," Transportation Research Part B: Methodological, Elsevier, vol. 42(2), pages 135-146, February.
    3. Renaud Masson & Anna Trentini & Fabien Lehuédé & Nicolas Malhéné & Olivier Péton & Houda Tlahig, 2017. "Optimization of a city logistics transportation system with mixed passengers and goods," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 81-109, March.
    4. Ho, Sin C. & Szeto, W.Y. & Kuo, Yong-Hong & Leung, Janny M.Y. & Petering, Matthew & Tou, Terence W.H., 2018. "A survey of dial-a-ride problems: Literature review and recent developments," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 395-421.
    5. Ansari, Sina & Başdere, Mehmet & Li, Xiaopeng & Ouyang, Yanfeng & Smilowitz, Karen, 2018. "Advancements in continuous approximation models for logistics and transportation systems: 1996–2016," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 229-252.
    6. Healy, Patrick & Moll, Robert, 1995. "A new extension of local search applied to the Dial-A-Ride Problem," European Journal of Operational Research, Elsevier, vol. 83(1), pages 83-104, May.
    7. Hall, Randolph W., 1996. "Pickup and delivery systems for overnight carriers," Transportation Research Part A: Policy and Practice, Elsevier, vol. 30(3), pages 173-187, May.
    8. Chen, Peng Will & Nie, Yu Marco, 2017. "Analysis of an idealized system of demand adaptive paired-line hybrid transit," Transportation Research Part B: Methodological, Elsevier, vol. 102(C), pages 38-54.
    9. Fu, Liping, 2002. "Scheduling dial-a-ride paratransit under time-varying, stochastic congestion," Transportation Research Part B: Methodological, Elsevier, vol. 36(6), pages 485-506, July.
    10. Ying Zhou & Hong Kim & Paul Schonfeld & Eungcheol Kim, 2008. "Subsidies and welfare maximization tradeoffs in bus transit systems," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 42(3), pages 643-660, September.
    11. Fan, Wenbo & Gu, Weihua & Xu, Meng, 2024. "Optimal design of ride-pooling as on-demand feeder services," Transportation Research Part B: Methodological, Elsevier, vol. 185(C).
    12. Masoud, Neda & Jayakrishnan, R., 2017. "A decomposition algorithm to solve the multi-hop Peer-to-Peer ride-matching problem," Transportation Research Part B: Methodological, Elsevier, vol. 99(C), pages 1-29.
    13. Edward Kim, M. & Schonfeld, Paul & Roche, Austin & Raleigh, Chelsie, 2022. "Optimal service zones and frequencies for flexible-route freight deliveries," Transportation Research Part A: Policy and Practice, Elsevier, vol. 159(C), pages 182-199.
    14. Luo, Sida & Nie, Yu (Marco), 2019. "Impact of ride-pooling on the nature of transit network design," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 175-192.
    15. Mantel, Ronald J. & Landeweerd, Henri R. A., 1995. "Design and operational control of an AGV system," International Journal of Production Economics, Elsevier, vol. 41(1-3), pages 257-266, October.
    16. Atieh Madani & Rajan Batta & Mark Karwan, 2021. "The balancing traveling salesman problem: application to warehouse order picking," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(2), pages 442-469, July.
    17. Inturri, Giuseppe & Le Pira, Michela & Giuffrida, Nadia & Ignaccolo, Matteo & Pluchino, Alessandro & Rapisarda, Andrea & D'Angelo, Riccardo, 2019. "Multi-agent simulation for planning and designing new shared mobility services," Research in Transportation Economics, Elsevier, vol. 73(C), pages 34-44.
    18. Chen, Peng (Will) & Nie, Yu (Marco), 2018. "Optimal design of demand adaptive paired-line hybrid transit: Case of radial route structure," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 110(C), pages 71-89.
    19. Soumia Ichoua & Michel Gendreau & Jean-Yves Potvin, 2000. "Diversion Issues in Real-Time Vehicle Dispatching," Transportation Science, INFORMS, vol. 34(4), pages 426-438, November.
    20. Daiki Min & Kwanghun Chung, 2017. "A Joint Optimal Decision on Shipment Size and Carbon Reduction under Direct Shipment and Peddling Distribution Strategies," Sustainability, MDPI, vol. 9(11), pages 1-21, November.
    21. Langevin, André & Mbaraga, Pontien & Campbell, James F., 1996. "Continuous approximation models in freight distribution: An overview," Transportation Research Part B: Methodological, Elsevier, vol. 30(3), pages 163-188, June.
    22. Masoud, Neda & Jayakrishnan, R., 2017. "A real-time algorithm to solve the peer-to-peer ride-matching problem in a flexible ridesharing system," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 218-236.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:12:y:1978:i:3:p:232-249. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.