IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v54y2003i8d10.1057_palgrave.jors.2601594.html
   My bibliography  Save this article

A probabilistic one-centre location problem on a network

Author

Listed:
  • O Berman

    (University of Toronto)

  • Z Drezner

    (California State University-Fullerton)

Abstract

In this paper we consider the one-centre problem on a network when the speeds on links are stochastic rather than deterministic. Given a desirable time to reach customers residing at the nodes, the objective is to find the location for a facility such that the probability that all nodes are reached within this time threshold is maximized. The problem is formulated, analyzed and solved by using multivariate normal probabilities. The procedure is demonstrated on an example problem.

Suggested Citation

  • O Berman & Z Drezner, 2003. "A probabilistic one-centre location problem on a network," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(8), pages 871-877, August.
    • Handle: RePEc:pal:jorsoc:v:54:y:2003:i:8:d:10.1057_palgrave.jors.2601594
    DOI: 10.1057/palgrave.jors.2601594
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601594
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601594?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Z. Drezner & G. O. Wesolowsky, 1981. "Optimum Location Probabilities in the l p Distance Weber Problem," Transportation Science, INFORMS, vol. 15(2), pages 85-97, May.
    2. Zvi Drezner & Saharon Shelah, 1987. "On the Complexity of the Elzinga-Hearn Algorithm for the 1-Center Problem," Mathematics of Operations Research, INFORMS, vol. 12(2), pages 255-261, May.
    3. D. Jack Elzinga & Donald W. Hearn, 1972. "The Minimum Covering Sphere Problem," Management Science, INFORMS, vol. 19(1), pages 96-104, September.
    4. Pitu B. Mirchandani & Amedeo R. Odoni, 1979. "Locations of Medians on Stochastic Networks," Transportation Science, INFORMS, vol. 13(2), pages 85-97, May.
    5. Donald W. Hearn & James Vijay, 1982. "Efficient Algorithms for the (Weighted) Minimum Circle Problem," Operations Research, INFORMS, vol. 30(4), pages 777-795, August.
    6. M. E. Dyer, 1983. "The Complexity of Vertex Enumeration Methods," Mathematics of Operations Research, INFORMS, vol. 8(3), pages 381-402, August.
    7. George O. Wesolowsky, 1977. "Probabilistic Weights in the One-Dimensional Facility Location Problem," Management Science, INFORMS, vol. 24(2), pages 224-229, October.
    8. H. Frank, 1967. "Letter to the Editor—A Note on a Graph Theoretic Game of Hakimi's," Operations Research, INFORMS, vol. 15(3), pages 567-570, June.
    9. G. Y. Handler, 1973. "Minimax Location of a Facility in an Undirected Tree Graph," Transportation Science, INFORMS, vol. 7(3), pages 287-293, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zvi Drezner & G. O. Wesolowsky, 1991. "Facility location when demand is time dependent," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(5), pages 763-777, October.
    2. Shiode, Shogo & Drezner, Zvi, 2003. "A competitive facility location problem on a tree network with stochastic weights," European Journal of Operational Research, Elsevier, vol. 149(1), pages 47-52, August.
    3. Drezner, Zvi & Scott, Carlton H., 1999. "On the feasible set for the squared Euclidean Weber problem and applications," European Journal of Operational Research, Elsevier, vol. 118(3), pages 620-630, November.
    4. Zhang, Bo & Li, Hui & Li, Shengguo & Peng, Jin, 2018. "Sustainable multi-depot emergency facilities location-routing problem with uncertain information," Applied Mathematics and Computation, Elsevier, vol. 333(C), pages 506-520.
    5. Igor Averbakh, 2005. "The Minmax Relative Regret Median Problem on Networks," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 451-461, November.
    6. Berman, Oded & Drezner, Zvi, 2008. "The p-median problem under uncertainty," European Journal of Operational Research, Elsevier, vol. 189(1), pages 19-30, August.
    7. Drezner, Zvi & Shiode, Shogo, 2007. "A distribution map for the one-median location problem on a network," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1266-1273, June.
    8. Esmaeil Afrashteh & Behrooz Alizadeh & Fahimeh Baroughi, 2020. "Optimal approaches for upgrading selective obnoxious p-median location problems on tree networks," Annals of Operations Research, Springer, vol. 289(2), pages 153-172, June.
    9. Fang Lu & John J. Hasenbein & David P. Morton, 2016. "Modeling and Optimization of a Spatial Detection System," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 512-526, August.
    10. Barbara Anthony & Vineet Goyal & Anupam Gupta & Viswanath Nagarajan, 2010. "A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems," Mathematics of Operations Research, INFORMS, vol. 35(1), pages 79-101, February.
    11. N. Brauner & Y. Crama & A. Grigoriev & J. Klundert, 2005. "A Framework for the Complexity of High-Multiplicity Scheduling Problems," Journal of Combinatorial Optimization, Springer, vol. 9(3), pages 313-323, May.
    12. Noltemeier, H. & Spoerhase, J. & Wirth, H.-C., 2007. "Multiple voting location and single voting location on trees," European Journal of Operational Research, Elsevier, vol. 181(2), pages 654-667, September.
    13. Miren Bilbao & Sergio Gil-López & Javier Ser & Sancho Salcedo-Sanz & Mikel Sánchez-Ponte & Antonio Arana-Castro, 2014. "Novel hybrid heuristics for an extension of the dynamic relay deployment problem over disaster areas," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(3), pages 997-1016, October.
    14. Jeong, Yoonjea & Kim, Gwang, 2023. "Reliable design of container shipping network with foldable container facility disruption," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 169(C).
    15. Chunsong Bai & Jun Du, 2024. "The Constrained 2-Maxian Problem on Cycles," Mathematics, MDPI, vol. 12(6), pages 1-9, March.
    16. P. M. Dearing & Pietro Belotti & Andrea M. Smith, 2016. "A primal algorithm for the weighted minimum covering ball problem in $$\mathbb {R}^n$$ R n," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 24(2), pages 466-492, July.
    17. Mulder, H.M. & Pelsmajer, M.J. & Reid, K.B., 2006. "Generalized centrality in trees," Econometric Institute Research Papers EI 2006-16, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    18. Zvi Drezner & Mozart B. C. Menezes, 2016. "The wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solution," Annals of Operations Research, Springer, vol. 246(1), pages 205-226, November.
    19. Gass, Saul I. & Roy, Pallabi Guha, 2003. "The compromise hypersphere for multiobjective linear programming," European Journal of Operational Research, Elsevier, vol. 144(3), pages 459-479, February.
    20. Azcuy, Irecis & Agatz, Niels & Giesen, Ricardo, 2021. "Designing integrated urban delivery systems using public transport," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 156(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pal:jorsoc:v:54:y:2003:i:8:d:10.1057_palgrave.jors.2601594. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.