A transportation location-allocation model for regional blood banking

AIIE Transactions

Volumn 11, Issue 2, 1979, Pages 86-95

  Or, Ilhan ^a   Pierskalla, William P ^b  

^a Industrial Engineering Department   (Turkey)

^b Leonard david institute of health economics ^*  (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

TRANSPORTATION;

EID: 0018478310     PISSN: 05695554     EISSN: None     Source Type: Journal    
DOI: 10.1080/05695557908974447     Document Type: Article

References (47)

1. Bellmoie, M. and G. L. Nemhausei, “The Traveling Salesman Problem: A Survey, ” Operations Research, 16, 538-558 (1968).
2. Brodheim, E, Hirsch, R. Practacos, G, “Setting Inventory Levels for Hospital Blood Banks, ” Transfusion, 16: 63 (1976).
3. Cassidy, P. J., and H. S. Bennett, “Tramp-A Multi-Depot Vehicle Scheduling System, ” Operations Research Quarterly, 23, 151-163(1972).
4. Charnes, A., and W. W. Cooper, “The Stepping-Stone Method of Explaining Linear Programming Calculations in Transportation Problems, ”Management Science, 1 (1954).
5. Christofides, N., and S. Eilon, “An Algorithm for the Vehicle Dispatch Problem, ” Operations Research Quarterly, 20, 309318 (1969).
6. Christofides, N., “The Shortest Hamiltonian Chain of a Graph, ” SIAM J. Appl. Math, 19, 689-696 (1970).
7. Christofides, N., “Bounds for the Traveling Salesman Problem, ” Operations Research, 20, 1044 (1972).
8. Christofides, N., and S. Eilon, “Algorithms for Large-Scale Traveling Salesman Problems, ” Operations Research Quarterly, 23, 511-518 (1972).
9. Clarke, G., and J. W. Wright, “Scheduling of Vehicles from a Central Depot to a Number of Delivery Points, ”Operations Research, 11, 568-581 (1963).
10. Cohen, M. A., W. P. Pierskalla, “Management Policies for a Regional Blood Bank, ” Transfusion, 15, 58-67 (1975).
11. Cohen, M. A., W. P. Pierskalla, H. S. Yen, I Or, “Regionalization and Regional Management Strategies for the Blood Banking System: An Overview, ” in Proceedings of the Second National Symposium on the Logistics of Blood Transfusion Therapy, June 19-20, 1975, sponsored by the Michigan Association of Blood Banks and the Michigan Community Blood Center, 3456 Woodward Ave., Detroit, Michigan 48201 (1975).
12. Cooper, L., “Location-AllocationProblems, ” Operations Research 11 (1963).
13. Cooper, L., “Heuristic Methods for Location-Allocation Problems, ” SIAM Review, 6 (1964).
14. Cooper, L., “The Transportation-Location Problem, ” Operations Research 20 (1972).
15. Francis, R. L„ and J. A. White; Facility Layout and Location, Prentice-Hall, Inc., Englewood c.UU;, N.J. rlJ74y
16. Francis, R. L. aid V. Cabor, “Properties of a Multi-Facility Location Problem Involving Euclidian Distances, ” Nov. Res. Log. Q (1972).
17. Gillett, B. E. and L. R. Miller, “A Heuristic Algorithm of the Vehicle-Dispatch Problem, ” Operations Research, 22, 340349 (1974).
18. Gillett, B. and J. Johnson, “Sweep Algorithm for the Multiple Depot Vehicle Dispatch Problem, ” presented at the ORSA TIMS meeting, San Juan, Puerto Rico (Oct. 1974).
19. Hansen, R. H., and J. Krarup, “Improvements of the Held-Karp Algorithm for the Symmetric Traveling Salesman Problem, ” Math. Prog. 7, 87-96 (1974).
20. Held, M. and R. M. Karp, “A Dynamic Programming Approach to Sequencing Problems, ” SIAM, 10, 196-210 (1962).
21. Held, M. and R. M. Karp, “The Traveling Salesman Problem and Minimum Spanning Trees, Part I, ” Operations Research, 18, 1138-1162(1970).
22. Held, M. and R. M. Karp, “The Traveling Salesman Problem and Minimum Spanning Trees, Part II, ” Math Prog., 1, 6-26 (1971).
23. Jennings, J., “Blood Bank Inventory Control, ” Management Science, 19, 637-645 (1973). Also appears in Analysis of Public Systems, R. Keenedy, P. Morse (eds.), MIT Press, Cambridge, Mass. (1972).
24. Jennings, J., “Inventory Control in Regional Blood Banking Systems, ” Technical Report Number 5 3, Operations Research Center, MIT (1970).
25. Karg, L. L. and G. L. Thompson, “A Heuristic Approach to Solving Traveling Salesman Problems, ” Management Science 10, 225-248 (1964).
26. Kruskal, J. B., “On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem, ” Proc. Amer. Math. Soc., 2, 48-50 (1956).
27. Lin, S., “Computer Solution of the Traveling Salesman Problem, ” Bell System Technical J., 44, 2245-2269 (1965).
28. Lin, S. and B. Kernighan, “An Effective Heuristic Algorithm for the Traveling Salesman Problem, ” Operations Research, 21, 498-516 (1973).
29. Little, J.D.C., R. G. Murty, D. W. Sweeney and C. Karel, “An Algorithm for the Traveling Salesman Problem, ” Operations Research, 11, 979-989 (1963).
30. Love, R. F., “A Non-Linear Programming Approach to Facilities Location Problems, ” Can. O.R. Soc., 5, 136-143 (1967).
31. Love, R. F., “Locating Facilities in Three Dimensional Space by Convex Programming, ” Nav. Res. Log. Q., 16, 503-516
32. Magnanti, T., B. L. Golden, and H. Q. Nguyen, “Implementing Vehicle Routing Algorithms, ” Technical Report No. 115, Operations Research Center, Massachusetts Institute of Technology (September 1975).
33. Magnanti, T., B. L. Golden, and H. Q. Nguyen, “Implementing Vehicle Routing Algorithms, ” Technical Report No. 115, Operations Research Center, Massachusetts Institute of Technology (September 1975).
34. Or, I., Traveling Salesman-Type Combinatorial Problems and Their Relation to the Logistics of Regional Blood Banking. Doctoral dissertation, Northwestern University.Evanston, Illinois 60201 (June 1976).
35. Or, I. and W. P. Pierskalla, “BTAP: A Computer Program to Obtain Solutions to the Blood Transportation-Allocation Problem and Other Traveling Salesman Type Problems, ” Technical Report, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois (August 1976).
36. Pierskalla, W. P. and H. Yen, “Shortage and Outdate Analysis for A Regional Blood Bank, ” Working Paper, National Health Care Management Center, University of Pennsylvania (1979).
37. Prastacos, G. P., “Allocation of a Perishable Product in a Region, ” Working Paper, The Wharton School, University of Pennsylvania, Philadelphia, Pa., (1977)
38. Prastacos, G. P., and E. Brodheim, “A Regional Blood, Distribution Model, ” Working Paper, The Wharton School, University of Pennsylvania, Philadelphia, Pa., (1977).
39. Prastacos, G. P., “Allocation of Perishable Inventory, ” Technical Report No. 70, Operations Research Group, Columbia University, New York, N.Y. (January, 1977).
40. Svestica, Huckfeldt, “Computational Experience with M- Salesman Traveling Salesman Problems, ” Management Science, 19(1973).
41. Tillman, F. A. and H. Cochran, “A Heuristic Approach for Solving the Delivery Problem, ” J. Indust. Eng., 19, 354-358 (1968).
42. Tyagi, M., “A Practical Method for the Truck Dispatching Problem, ”/. Oprs. Soc. Japan, 10. 76-92 (1970).
43. Wendell, R. E. and A. P. Hurter, “Location Theory, Dominance, and Convexity, ” Operations Research, 21, 314-320 (1973).
44. Wendell, R. E. and A. P. Hurter, “Optimal Locations on a Network, ” Transportation Science, 7, 18-33 (1973).
45. Wren, A. and A. Holliday, “Computer Scheduling of Vehicles from One or More Depots to a Number of Delivery Points, ” Operations Research Q„ 23, 333-344 (1972).
46. Yahnke, D. P., A. A. Rimm, C. J. Mundt, R. H. Aster, and T. M. Hurst, “Analysis and Optimization of a Regional Blood Bank Distribution Process, I: Introduction and Descriptive Analysis, ” Transfusion 12, 11 (1972).
47. Yen, H., Inventory Management for a Perishable Product Multi-echelon System. Doctoral Dissertation. Northwestern University, Evanston, Illinois (August 1975).