References:
Braekers, K., Caris, A. and Janssens, G. K. (2014). Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots, Transportation Research Part B: Methodological 67: 166-186.
Braekers, K. and Kovacs, A. A. (2016). A multi-period dial-a-ride problem with driver consistency, Transportation Research Part B: Methodological 94: 355-377.
Cordeau, J.-F. (2006). A branch-and-cut algorithm for the dial-a-ride problem, Operations Research 54(3): 573-586.
Cordeau, J.-F. and Laporte, G. (2003). A tabu search heuristic for the static multi-vehicle dial-a-ride problem, Transportation Research Part B: Methodological 37(6): 579-594.
Lim, A., Zhang, Z. and Qin, H. (2017). Pickup and delivery service with manpower planning in Hong Kong public hospitals, Transportation Science 51(2): 688-705.
Liu, M., Luo, Z. and Lim, A. (2015). A branch-and-cut algorithm for a realistic dial-a-ride problem, Transportation Research Part B: Methodological 81, Part 1: 267-288.
Parragh, S. N. (2011). Introducing heterogeneous users and vehicles into models and algorithms
for the dial-a-ride problem, Transportation Research Part C: Emerging Technologies 19(5): 912-930.
Parragh, S. N., de Sousa, J. P. and Almada-Lobo, B. (2015). The dial-a-ride problem with split requests and profits, Transportation Science 49(2): 311-334.
Ropke, S., Cordeau, J.-F. and Laporte, G. (2007). Models and branch-and-cut algorithms for pickup and delivery problems with time windows, Networks 49: 258-272.
Zhang, Z., Liu, M. and Lim, A. (2015). A memetic algorithm for the patient transportation problem, Omega 54: 60-71.