1. The swapping problem;Anily;Networks,1992
2. Ascheuer, N., Krumke, S.O., Rambau, J., 2000. Online dial-a-ride problems: Minimizing the completion time. In: STACS 2000. Lecture Notes in Computer Science, vol. 1770. Springer, Berlin, pp. 639–650.
3. Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem;Attanasio;Parallel Computing,2004
4. Beaudry, A., Laporte, G., Melo, T., Nickel, S., in press. Dynamic transportation of patients in hospitals. OR Spectrum.
5. Static pickup and delivery problems: A classification scheme and survey;Berbeglia;Top,2007