×

Location-allocation on congested networks. (English) Zbl 0595.90013

Summary: This paper deals with location-allocation decisions in networks under conditions of congestion, i.e. taking into consideration the possible arrival of calls for service while no server is available. The problem is to find simultaneously the optimal districting policy which determines how a region should be partitioned into separate service areas, and the optimal location of facilities to house the service units. An alternate location and allocation solution improvement procedure is developed to combine an existing location algorithm of a single mobile service unit with an existing districting heuristic for two servers. The 2-server districting heuristic is further extended to treat the general case of m servers, and combined with the location algorithm for a single server it forms a general location-allocation heuristic for n nodes and m servers.

MSC:

90B05 Inventory, storage, reservoirs
90B22 Queues and service in operations research
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Ahituv, N.; Berman, O., Quantitative models for policy making in urban emergency networks, International Journal of Policy and Information, 6, 2, 35-42 (1982)
[2] Beaumont, J. R., Location-allocation problems in a plane, A review of some models, Socio-Economic Planning Sciences, 15, 5, 217-229 (1981)
[3] Berman, O.; Larson, R. C.; Chiu, S. S., Optimal server location on a network operating as an M/G/1 queue, Operations Research, 12, 4, 746-771 (1985), to appear in · Zbl 0576.90031
[4] Berman, O.; Wand, Y., Service decisions with two criteria, IEEE Transactions, 12, 4, 549-551 (1982)
[5] Berman, O.; Larson, R. C., Optimal 2-facility network districting in the presence of queuing, Transportation Science, 19, 3, 261-277 (1985), to appear in · Zbl 0606.90053
[6] Berman, O.; Mandowsky, R. R., Location allocation on congested networks (May 1984), Faculty of Management, The University of Calgary, WP-08-84
[7] Carter, G. M.; Chaiken, J. M.; Ignall, E., Response areas for two emergency units, Operations Research, 20, 3, 571-594 (1982) · Zbl 0238.60087
[8] Cooper, L., Heuristic methods for location-allocation problems, SIAM Review, 6, 1, 37-53 (1964) · Zbl 0956.90014
[9] Ignall, E., Response groups of fire-fighting units Itheory (October 1971), The New York City Rand Institute,, WW-7561NYC
[10] Keeney, R. L., A method of districting among facilities, Operations Research, 20, 3, 613-618 (1972) · Zbl 0238.90032
[11] Larson, R. C.; Stevenson, K. A., On insensitivities in urban redistricting and facility location, Operations Research, 20, 3, 595-612 (1972) · Zbl 0238.60088
[12] Tansel, B. C.; Francis, R. L.; Lowe, T. J., Location on networks: A survey, Management Science, 29, 4, 382-511 (1983) · Zbl 0513.90023
[13] Wagner, H. M., Principles of Operations Research (1975), Prentice-Hall: Prentice-Hall New York, Chapter 15
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.