Optimizing dial-a-ride services in Maryland: Benefits of computerized routing and scheduling

Berbeglia, 2007, ‘Static pickup and delivery problems: a classification scheme and survey’, Top, 15, 1, 10.1007/s11750-007-0009-0 Borndörfer, 1999 Cordeau, 2006, ‘A branch-and-cut algorithm for the dial-a-ride problem’, Oper. Res., 54, 573, 10.1287/opre.1060.0283 Cordeau, 2003, ‘The dial-a-ride problem (DARP): variants, modeling issues and algorithms’, Q. J. Belg. Fr. Ital. Oper. Res. Soc., 1, 89 Cordeau, 2003, ‘A tabu search heuristic for the static multi-vehicle dial-a-ride problem’, Transp. Res. Part B: Meth., 37, 579, 10.1016/S0191-2615(02)00045-0 Cordeau, 2007, ‘The dial-a-ride problem: models and algorithms’, Ann. Oper. Res., 153, 29, 10.1007/s10479-007-0170-8 Fitzsimmons, 2006 GAO. 2012. Ada paratransit services: demand has increased, but little is known about compliance, Report, United States Government Accountability Office. Golden, 1984, The fleet size and mix vehicle routing problem, Comput. Oper. Res., 11, 49, 10.1016/0305-0548(84)90007-8 Heilporn, 2011, ‘An integer L-shaped algorithm for the dial-a-ride problem with stochastic customer delays’, Discr. Appl. Math., 159, 883, 10.1016/j.dam.2011.01.021 Jaw, 1986, A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows, Transp. Res. Part B: Meth., 20, 243, 10.1016/0191-2615(86)90020-2 Luo, Y. 2006. Heuristics and performance metamodels for the dynamic dial-a-ride problem (Ph.D. thesis). Luo, 2007, A rejected-reinsertion heuristic for the static dial-a-ride problem, Transp. Res. Part B: Meth., 41, 736, 10.1016/j.trb.2007.02.003 Madsen, 1995, A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives, Anna. Oper. Res., 60, 193, 10.1007/BF02031946 Marković, N., Nair, R., Schonfeld, P., Miller-Hooks, E., Mohebbi, M. 2014. Optimizing dial-a-ride services in Maryland. In Transportation Research Board 93rd Annual Meeting, number 14-1705. Mohebbi, M., Ditu, C.V., Siddiqui, M.I.Y. 2011. Efficient automated ride sharing system. US Patent Application 13/247, 446. Parragh, 2011, Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem, Transp. Res. Part C: Emerg. Technol., 19, 912, 10.1016/j.trc.2010.06.002 Parragh, 2010, Variable neighborhood search for the dial-a-ride problem, Comput. Oper. Res., 37, 1129, 10.1016/j.cor.2009.10.003 Toth, 1996, Fast local search algorithms for the handicapped persons transportation problem, 677