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.
Chassaing, M., Duhamel, C. and Lacomme, P. (2016). An ELS-based approach with dynamic probabilities management in local search for the dial-a-ride problem, Engineering Applications of Artificial Intelligence 48: 119-133.
Gschwind, T. and Drexl, M. (2016). Adaptive large neighborhood search with a constant-time feasibility test for the dial-a-ride problem, Technical Report LM-2016-08, Johannes Gutenberg University, Mainz. http://logistik.bwl.uni-mainz.de/Dateien/LM-2016-08.pdf.
Masmoudi, M. A., Braekers, K., Masmoudi, M. and Dammak, A. (2017). A hybrid genetic algorithm for the heterogeneous dial-a-ride problem, Computers & Operations Research 81: 1-13.
Masmoudi, M. A., Hosny, M., Braekers, K. and Dammak, A. (2016). Three effective metaheuristics to solve the multi-depot multi-trip heterogeneous dial-a-ride problem, Transportation Research Part E: Logistics and Transportation Review 96: 60-80.
Masson, R., Lehuédé, F. and Péton, O. (2014). The dial-a-ride problem with transfers, Computers & Operations Research 41: 12-23.
Molenbruch, Y., Braekers, K. and Caris, A. (2017a). Benefits of horizontal cooperation in dial-a-ride services, Transportation Research Part E: Logistics and Transportation Review 107: 97-119.
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., Doerner, K. F. and Hartl, R. F. (2010). Variable neighborhood search for the dial-a-ride problem, Computers & Operations Research 37(6): 1129-1138.
Parragh, S. N. and Schmid, V. (2013). Hybrid column generation and large neighborhood search for the dial-a-ride problem, Computers & Operations Research 40(1): 490-497.
Qu, Y. and Bard, J. F. (2013). The heterogeneous pickup and delivery problem with configurable vehicle capacity, Transportation Research Part C: Emerging Technologies 32: 1-20.
Ritzinger, U., Puchinger, J. and Hartl, R. F. (2016). Dynamic programming based metaheuristics for the dial-a-ride problem, Annals of Operations Research 236(2): 341-358.