- BodinL.D. and SextonT.R. (1982). The Multi-Vehicle Subscriber Dial-A-Ride Problem. Working Paper No. 82–005, Department of Management Science and Statistics, College of Business and Management, University of Maryland, College ParkMaryland 20742.
- FisherM.L. (1980). Worst-Case Analysis of Heuristic Algorithms. Management Science 26, 1–16.
- GoldenB., BodinL.D., DoyleT., StewartW.Jr. (1980). Approximate Traveling Salesman Algorithms. Operations Research 28, 694–711.
- HungH.K., ChapmanR.E., HallW.G., NeigutE. (1982). A Heuristic Algorithm for Routing and Scheduling Dial-A-Ride Vehicles. ORSA/TIMS National Meeting, San Diego, California.
- JawJ.J. (1984). Heuristic Algorithm for Multi-Vehicle, Advance-Request Dial-A-Ride Problems. Ph.D. Thesis, Department of Aeronautics and Astronautics, M.I.T., CambridgeMassachusetts 02139.
- JawJ.J., OdoniA.R., PsaraftisH.N., and WilsonN.H.M. (1982). A Heuristic Algorithm for the Multi-Vehicle Many-to-Many Advance-Request Dial-A-Ride Problem. Working Paper MIT-UMTA-82–3, M.I.T., CambridgeMassachusetts 02139.
- JawJ.J., OdoniA.R., PsaraftisH.N., and WilsonN.H.M. (1984). A Heuristic Algorithm for the Multi-Vehicle Advance-Request Dial-A-Ride Problem with Time Windows. Transportation Research (8), to appear.
- LinS., KernighanB.W. (1973). An Effective Heuristic Algorithm for the Traveling Salesman Problem. Operations Research 21, 498–516.
- PapadimitriouC.H., SteiglitzK. (1978). Some Examples of Difficult Traveling Salesman Problems. Operations Research 26, 434–443.
- PsaraftisH.N. (1980). A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-A-Ride Problem. Transportation Science 14, 130–154.
- PsaraftisH.N. (1983a). An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time Windows. Transportation Science 17, 351–357.
- PsaraftisH.N. (1983b). k-Interchange Procedures for Local Search in a Precedence-Constrained Routing Problem. European Journal of Operational Research 13, 391–402.
- PsaraftisH.N. (1983c). Analysis of an 0(N2) Heuristic for the Single Vehicle Many-to-Many Euclidean Dial-A-Ride Problem. Transportation Research 17B, 133–145.
- RosenkrantzD.J., StearnsR.E., LewisP.M. (1974). Approximate Algorithms for the Traveling Salesperson Problem. Proceedings of the 15th Annual IEEE Symposium of Switching and Automata Theory, 33–42.
- RoyS., ChapleauL., FerlandJ., LapalmeG., and RousseauJ.M. (1983). The Construction of Routes and Schedules for the Transportation of the Handicapped. Working Paper, Publication No. 308, Centre de Recherche sur les Transports, University of Montreal, Case Postale 6128 - Succursale A, Montreal, PQ, Canada H3C 3J7.
- SextonT.R. (1979). The Single Vehicle Many-to-Many Routing and Scheduling Problem. Ph.D. Thesis, State University of New York at Stony Brook, New York 11738.
- SolomonM.M. (1983). On the Worst-Case Performance of Some Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints. Working Paper 84–02, Graduate School of Business Administration, Northeastern University, BostonMassachusetts 02115.
- WilsonN.H.M., WeissbergH. (1976). Advanced Dial–A-Ride Algorithms Research Project: Final Report. Report R76–20. Department of Civil Engineering, M.I.T. Report R-76–20, Cambridge, Massachusetts 02139.
- WilsonN.H.M., ColvinN.H. (1977). Computer Control of the Rochester Dial-A-Ride System. Report R77–31. Department of Civil Engineering, M.I.T. Report R77–31, Cambridge, Massachusetts 02139.
- 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