Isodistant points in competitive network facility location
An isodistant point is any point on a network which is located at a predetermined distance from some node. For some competitive facility location problems on a network, it is verified that optimal (or near-optimal) locations are found in the set of nodes and isodistant points (or points in the vicinity of isodistant points). While the nodes are known, the isodistant points have to be determined for each problem. Surprisingly, no algorithm has been proposed to generate the isodistant points on a network. In this paper, we present a variety of such problems and propose an algorithm to find all isodistant points for given threshold distances associated with the nodes. The number of isodistant points is upper bounded by nm, where n and m are the number of nodes and the number of edges, respectively. Computational experiments are presented which show that isodistant points can be generated in short run time and the number of such points is much smaller than nm. Thus, for networks of moderate size, it is possible to find optimal (or near-optimal) solutions through the Integer Linear Programming formulations corresponding to the discrete version of such problems, in which a finite set of points are taken as location candidates. Copyright Sociedad de Estadística e Investigación Operativa 2012
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.
Volume (Year): 20 (2012)
Issue (Month): 3 (October)
|Contact details of provider:|| Web page: http://www.springer.com|
Web page: http://www.seio.es/
|Order Information:||Web: http://link.springer.de/orders.htm|
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.:
- Osborne, Martin J & Pitchik, Carolyn, 1987.
"Equilibrium in Hotelling's Model of Spatial Competition,"
Econometric Society, vol. 55(4), pages 911-922, July.
- Martin J Osborne & Carolyn Pitchik, 1985. "Equilibrium in Hotelling's Model of Spatial Competition," Department of Economics Working Papers 1985-02, McMaster University.
- Peter Peeters & Frank Plastria, 1998. "Discretization results for the Huff and Pareto-Huff competitive location models on networks," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 6(2), pages 247-260, December.
- Plastria, Frank, 2001. "Static competitive facility location: An overview of optimisation approaches," European Journal of Operational Research, Elsevier, vol. 129(3), pages 461-470, March.
- Daniel Serra & Charles Revelle, 1994. "Competitive location in discrete space," Economics Working Papers 96, Department of Economics and Business, Universitat Pompeu Fabra.
- Rafael Suárez-Vega & Dolores R. Santos-Peñate & Pablo Dorta-González, 2007. "The follower location problem with attraction thresholds," Papers in Regional Science, Wiley Blackwell, vol. 86(1), pages 123-137, 03.
- ReVelle, C. S. & Eiselt, H. A., 2005. "Location analysis: A synthesis and survey," European Journal of Operational Research, Elsevier, vol. 165(1), pages 1-19, August.
- Daniel Serra & Charles Revelle, 1997. "Competitive location and pricing on networks," Economics Working Papers 219, Department of Economics and Business, Universitat Pompeu Fabra.
- Hakimi, S. Louis, 1983. "On locating new facilities in a competitive environment," European Journal of Operational Research, Elsevier, vol. 12(1), pages 29-35, January.
When requesting a correction, please mention this item's handle: RePEc:spr:topjnl:v:20:y:2012:i:3:p:639-660. 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: (Sonal Shukla)or (Rebekah McClure)
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.