Advanced Search
MyIDEAS: Login to save this paper or follow this series

On optimal location with treshold requirements

Contents:

Author Info

  • Miquel Carreras
  • Daniel Serra

    ()

Abstract

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.

Download Info

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.
File URL: http://www.econ.upf.edu/docs/papers/downloads/220.pdf
File Function: Whole Paper
Download Restriction: no

Bibliographic Info

Paper provided by Department of Economics and Business, Universitat Pompeu Fabra in its series Economics Working Papers with number 220.

as in new window
Length:
Date of creation: Mar 1997
Date of revision:
Handle: RePEc:upf:upfgen:220

Contact details of provider:
Web page: http://www.econ.upf.edu/

Related research

Keywords: Discrete facility location; threshold; tabu search;

Other versions of this item:

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

References

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.:
as in new window
  1. 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.
  2. 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.
  3. ReVelle, Charles, 1993. "Facility siting and integer-friendly programming," European Journal of Operational Research, Elsevier, vol. 65(2), pages 147-158, March.
  4. 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.
  5. 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.
  6. 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.
  7. 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.
  8. 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.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Francisco Silva & Daniel Serra, 2008. "Incorporating waiting time in competitive location models: Formulations and heuristics," Economics Working Papers 1091, Department of Economics and Business, Universitat Pompeu Fabra.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:upf:upfgen:220. 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: ().

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.