1. A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows
2. Jaw, J. J., Odoni, A. R., Psaraftis, H. N. and Wilson, N. H. M. 1982. “A heuristic algorithm for the multi‐vehicle many‐to‐many advance‐request dial‐a‐ride problem.”. Cambridge, MA: M.I.T. Working paper MIT‐UMTA‐82–3,
3. Routing and scheduling of vehicles and crews
4. Roy, S., Rousseau, J. M., Lapalme, G. and Ferland, J. June 1985. “Routing and scheduling for the transportation of the disabled persons: the algorithm.”. June, Centre de recherche sur les transports, Universite de Montreal. Publication #412A,