- ArmstrongG.R. and GarfinkelR.S. (1982). Dynamic programming solution of the single and multiple pick-up and delivery problem with application to dial-a-ride. Working Paper #162, College of Business Administration, University of Tennessee, KnoxvilleTN.
- BélisleJ.-P., SoumisF., RoyS., DesrosiersJ., DumasY. and RousseauJ.-M. (1984). The impact on vehicle routing of various operational rules of a transportation System for handicapped persons. Publication #363*, Centre de recherche sur les transports, Université de Montréal, Montréal, Canada H3J 3J7. (Presented at the Third International Conference on Mobility and Transport of Elderly and Handicapped Persons, Orlando, Florida).
- BellemoreM. and NemhauserG.L. (1968). The travelling salesman problem - a survey. Operations Research 16, 538–558.
- BodinL., GoldenB., AssadA. and BallM. (1983). Routing and scheduling of vehicles and crews - The state of the art. Computers and Operations Research 10, 63–211.
- BodinL. and SextonT. (1986). The multi-vehicle subscriber dial-a-ride problem. The Delivery of Urban Services, TIMS Studies in the Management Science 22, forthcoming.
- DesrosiersJ., DumasY. and SoumisF. (1984). The multiple vehicle many to many routing problem with time windows. Publication #362, Centre de recherche sur les transports, Université de Montréal, Montréal, Canada H3C 3J7.
- DesrosiersJ., PelletierP. and SoumisF. (1983). Plus court chemin avec contraintes d'horaires. R.A.I.R.0. 17, 4, 357–377.
- JawJ., OdoniA., PsaraftisH. and WilsonN. (1984). A heuristic algorithm for the multi-vehicle advanced request dial-a-ride problem with time windows. Working Paper MIT-UMTA-83-L, MIT, Cambridge, Ma 02139.
- PsaraftisH. (1980), A dynamic programming solution to the single vehicle many to many immediate request dial-a-ride problem. Transportation Science 14 (2), 130–154.
- PsaraftisH. (1982). An exact algorithm for the single vehicle many to many dial-a-ride problem with time windows, Technical Note OE-UMTA-82–2, M.I.T., Cambridge, MA 02139.
- PsaraftisH. (1983). Analysis of an 0(N2) heuristic for the single vehicle many-to-many euclidian dial-a-ride problem. Transportation Research B 17B (2), 133–145.
- RoyS., RousseauJ.-M., LapalmeG. and FerlandJ.A. (1984a). Routing and scheduling for the transportation of disabled persons - The algorithm. TP 5596E. Transport Development Centre, Transport Canada Montréal, Canada H2Z 1X4.
- RoyS., RousseauJ.-M., LapalmeG. and FerlandJ.A. (1984b), Routing and scheduling for the transportation for disabled persons - The tests. TP 5598E. Transport Development Centre, Transport Canada, Montréal, Canada H2Z 1X4.
- SextonT. and BodinL. (1985a), Optimizing single vehicle many-to many operations with desired delivery times: I. Scheduling. Transportation Science 10 (4), 378–410.
- SextonT. and BodinL. (1985b), Optimizing single vehicle many–to many operations with desired delivery times: II. Routing. Transportation Science 10 (4), 411–435.
- Choose new content alerts to be informed about new research of interest to you
- Easy remote access to your institution's subscriptions on any device, from any location
- Save your searches and schedule alerts to send you new results
- Export your search results into a .csv file to support your research