On optimal location with threshold requirements
The optimal location of services is one of the most important factors that affects service quality in terms of consumer access. On the other hand, services in general need to have a minimum catchment area so as to be efficient. In this paper a model is presented that locates the maximum number of services that can coexist in a given region without having losses, taking into account that they need a minimum catchment area to exist. The objective is to minimize average distance to the population. The formulation presented belongs to the class of discrete P--median--like models. A tabu heuristic method is presented to solve the problem. Finally, the model is applied to the location of pharmacies in a rural region of Spain.
(This abstract was borrowed from another version of this item.)
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- D Serra & S Ratick & C ReVelle, 1996.
"The maximum capture problem with uncertainty,"
Environment and Planning B: Planning and Design,
Pion Ltd, London, vol. 23(1), pages 49-59, January.
- D Serra & S Ratick & C ReVelle, 1996. "The Maximum Capture Problem with Uncertainty," Environment and Planning B, , vol. 23(1), pages 49-59, February.
- Daniel Serra & Samuel Ratick & Charles Revelle, 1994. "The maximum capture problem with uncertainty," Economics Working Papers 74, Department of Economics and Business, Universitat Pompeu Fabra.
- Hasan Pirkul & David A. Schilling, 1991. "The Maximal Covering Location Problem with Capacities on Total Workload," Management Science, INFORMS, vol. 37(2), pages 233-248, February.
- P J Densham & G Rushton, 1992. "Strategies for solving large location-allocation problems by heuristic methods," Environment and Planning A, Pion Ltd, London, vol. 24(2), pages 289-304, February.
- P V Balakrishnan & J E Storbeck, 1991. "McTHRESH: modeling maximum coverage with threshold constraints," Environment and Planning B: Planning and Design, Pion Ltd, London, vol. 18(4), pages 459-472, July.
- labbe, M. & Peeters, D. & Thisse, J.F., 1992. "Location on Networks," Papers 9216, Universite Libre de Bruxelles - C.E.M.E..
- LABBE, Martine & PEETERS, Dominique & THISSE, Jacques-François, 1993. "Location on Networks," CORE Discussion Papers 1993040, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- P V Balakrishnan & A Desai & J E Storbeck, 1994. "Efficiency evaluation of retail outlet networks," Environment and Planning B: Planning and Design, Pion Ltd, London, vol. 21(4), pages 477-488, July.
- J R Current & J E Storbeck, 1988. "Capacitated covering models," Environment and Planning B: Planning and Design, Pion Ltd, London, vol. 15(2), pages 153-163, March.
- Cornuejols, G. & Sridharan, R. & Thizy, J. M., 1991. "A comparison of heuristics and relaxations for the capacitated plant location problem," European Journal of Operational Research, Elsevier, vol. 50(3), pages 280-297, February.
- ReVelle, Charles, 1993. "Facility siting and integer-friendly programming," European Journal of Operational Research, Elsevier, vol. 65(2), pages 147-158, March.
- P V Balakrishnan & A Desai & J E Storbeck, 1994. "Efficiency Evaluation of Retail Outlet Networks," Environment and Planning B, , vol. 21(4), pages 477-488, August.
- J R Current & J E Storbeck, 1988. "Capacitated Covering Models," Environment and Planning B, , vol. 15(2), pages 153-163, June. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:eee:soceps:v:33:y:1999:i:2:p:91-103. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.