An integrated spatial DSS for scheduling and routing home-health-care nurses

Interfaces

Volumn 27, Issue 4, 1997, Pages 35-48

  Begur, Sachidanand V ^a   Miller, David M ^b   Weaver, Jerry R ^c  

^a LCG Consulting   (United States)

^b UNIVERSITY OF ALABAMA   (United States)

^c Dept of Mgmt Sci and Statistics ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040651973     PISSN: 00922102     EISSN: None     Source Type: Journal    
DOI: 10.1287/inte.27.4.35     Document Type: Article

References (19)

1. Agarwal, Yogesh; Mathur, Kamlesh; and Salkin, Harvey M. 1989, "A set-partitioning based exact algorithm for the vehicle routing problem," Networks, Vol. 19, No. 7, pp. 731-749.
2. Ballou, Ronald H. and Agarwal, Yogesh K. 1988, "A performance comparison of several popular algorithms for vehicle routing and scheduling," Journal of Business Logistics, Vol. 9, No. 1, pp. 51-65.
3. Bylinsky, Gene 1989, "Managing with electronic maps," Fortune, Vol. 119, No. 9 (April 24), pp. 237-254.
4. Christofides, N. and Eilon, S. 1969, "An algorithm for the vehicle-dispatching problem," Operations Research Quarterly, Vol. 20, No. 12, pp. 309-318.
5. Christofides, N.; Mingozzi, A.; and Toth, P. 1981, "Exact algorithms tor the vehicle routing problem, based on spanning tree and shortest path relaxations," Mathematical Programming, Vol. 20, No. 3, pp. 255-282.
6. Clarke, G. and Wright, J. W. 1964, "Scheduling of vehicles from a central depot to a number of delivery points," Operations Research, Vol. 12, No. 4 (July-August), pp. 568-581.
7. Cooke, Donald F. 1991, "New category of computer software opens digital map industry to all," GDT News, Vol. 7, No. 1 (Winter), p. 1.
8. Erkut, Erhan and MacLean, Doug 1992, "Alberta's energy efficiency branch conducts transportation audits," Interfaces, Vol. 22, No. 3, pp. 15-21.
9. Gillett, B, E. and Miller, L. R. 1974, "A heuristic algorithm for the vehicle dispatch problem," Operations Research, Vol. 22, No. 2 (March-April), pp. 340-349.
10. Golden, B. L. 1977, "Evaluating a sequential vehicle routing algorithm," AIIE Transactions, Vol. 9, No. 2, pp. 204-208.
11. Haimovich, M. and Rinnooy Kan, A. 1985, "Bounds and heuristics for capacitated routing problems," Mathematics of Operations Research, Vol. 10, No. 4 (November), pp. 527-542.
12. Held, M. and Karp, R. M. 1971, "The traveling salesman problem and minimum spanning trees: Part ii," Mathematical Programming, Vol. 1, No. 1 (October), pp. 6-25.
13. Johnson, Carl R. and Goldman, Mark J. 1990, "GIS: Easing infrastructure management," Civil Engineering, Vol. 60, No. 6, pp. 42-44.
14. Laporte, Gilbert; Nobert, Yves; and Desrochers, Martin 1985, "Optimal routing under capacity and distance restrictions," Operations Research, Vol. 33, No. 5, pp. 1050-1073.
15. Lin, S. and Kernighan, B. W. 1973, "An efficient heuristic algorithm for the traveling salesman problem," Operations Research, Vol. 21, No. 2 (March-April), pp. 498-516.
16. Mak, King-Tim and Srikanth, Kizhanatham 1990, "Visualization of routing problems," CRIM Working Paper Number 90-03, Department of Information and Decision Science, Commerce and Business Administration, University of Illinois at Chicago (August).
17. Paessens, H. 1988, "The savings algorithm for the vehicle routing problem," European Journal of Operational Research, Vol. 34, No. 1 (February), pp. 336-344.
18. Simkowitz, Howard J. 1989, "GIS: Technology for transportation," Civil Engineering, Vol. 59, No. 6, pp. 72-75.
19. Rosenkrantz, D.; Sterns, R.; and Lewis, P. 1977, "An analysis of several heuristics for the traveling salesman problem," SIAM Journal of Computing, Vol. 6, No. 3, pp. 563-581.