IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v37y1990i6p929-935.html
   My bibliography  Save this article

Queueing‐location problems on the plane

Author

Listed:
  • Zvi Drezner
  • Siegfried Schaible
  • David Simchi‐Levi

Abstract

In this article we present a queueing‐location problem where a location of a service station has to be determined. The two main results of this article are a convexity proof for general distances and a theorem that limits the area in the plane where the solution can lie. We also propose some solution procedures.

Suggested Citation

  • Zvi Drezner & Siegfried Schaible & David Simchi‐Levi, 1990. "Queueing‐location problems on the plane," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(6), pages 929-935, December.
    • Handle: RePEc:wly:navres:v:37:y:1990:i:6:p:929-935
    DOI: 10.1002/1520-6750(199012)37:63.0.CO;2-8
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199012)37:63.0.CO;2-8
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199012)37:63.0.CO;2-8?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
    ---><---

    References listed on IDEAS

    as
    1. Lawrence M. Ostresh, 1978. "On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem," Operations Research, INFORMS, vol. 26(4), pages 597-609, August.
    2. C. R. Bector, 1968. "Programming Problems with Convex Fractional Functions," Operations Research, INFORMS, vol. 16(2), pages 383-391, April.
    3. Oded Berman & Richard C. Larson & Samuel S. Chiu, 1985. "Optimal Server Location on a Network Operating as an M / G /1 Queue," Operations Research, INFORMS, vol. 33(4), pages 746-771, August.
    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


    Cited by:

    1. Mojtaba Borza & Azmin Sham Rambely, 2021. "A Linearization to the Sum of Linear Ratios Programming Problem," Mathematics, MDPI, vol. 9(9), pages 1-10, April.

    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. Burkard, Rainer E. & Galavii, Mohammadreza & Gassner, Elisabeth, 2010. "The inverse Fermat-Weber problem," European Journal of Operational Research, Elsevier, vol. 206(1), pages 11-17, October.
    2. V Marianov & T B Boffey & R D Galvão, 2009. "Optimal location of multi-server congestible facilities operating as M/E r /m/N queues," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(5), pages 674-684, May.
    3. Wang, Zhaodong & Xie, Siyang & Ouyang, Yanfeng, 2022. "Planning reliable service facility location against disruption risks and last-mile congestion in a continuous space," Transportation Research Part B: Methodological, Elsevier, vol. 165(C), pages 123-140.
    4. Ouyang, Yanfeng & Wang, Zhaodong & Yang, Hai, 2015. "Facility location design under continuous traffic equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 81(P1), pages 18-33.
    5. Venkateshan, Prahalad & Mathur, Kamlesh & Ballou, Ronald H., 2010. "Locating and staffing service centers under service level constraints," European Journal of Operational Research, Elsevier, vol. 201(1), pages 55-70, February.
    6. Lawrence V. Snyder & Mark S. Daskin, 2005. "Reliability Models for Facility Location: The Expected Failure Cost Case," Transportation Science, INFORMS, vol. 39(3), pages 400-416, August.
    7. Vladimir Marianov & Daniel Serra, 2000. "Location models for airline hubs behaving as M/D/c queues," Economics Working Papers 453, Department of Economics and Business, Universitat Pompeu Fabra.
    8. An, Shi & Cui, Na & Bai, Yun & Xie, Weijun & Chen, Mingliu & Ouyang, Yanfeng, 2015. "Reliable emergency service facility location under facility disruption, en-route congestion and in-facility queuing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 82(C), pages 199-216.
    9. Robert Aboolian & Oded Berman & Zvi Drezner, 2009. "The multiple server center location problem," Annals of Operations Research, Springer, vol. 167(1), pages 337-352, March.
    10. Adi Ben-Israel & Cem Iyigun, 2008. "Probabilistic D-Clustering," Journal of Classification, Springer;The Classification Society, vol. 25(1), pages 5-26, June.
    11. Marianov, Vladimir & Serra, Daniel, 2001. "Hierarchical location-allocation models for congested systems," European Journal of Operational Research, Elsevier, vol. 135(1), pages 195-208, November.
    12. Zvi Drezner, 2009. "On the convergence of the generalized Weiszfeld algorithm," Annals of Operations Research, Springer, vol. 167(1), pages 327-336, March.
    13. Richard L. Church & Zvi Drezner & Pawel Kalczynski, 2023. "Extensions to the planar p-median problem," Annals of Operations Research, Springer, vol. 326(1), pages 115-135, July.
    14. Frenk, J.B.G. & Gromicho, J.A.S. & Zhang, S., 1994. "A deep cut ellipsoid algorithm for convex programming," Econometric Institute Research Papers 11633, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    15. F Silva & D Serra, 2008. "Locating emergency services with different priorities: the priority queuing covering location problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(9), pages 1229-1238, September.
    16. Geroliminis, Nikolas & Kepaptsoglou, Konstantinos & Karlaftis, Matthew G., 2011. "A hybrid hypercube - Genetic algorithm approach for deploying many emergency response mobile units in an urban network," European Journal of Operational Research, Elsevier, vol. 210(2), pages 287-300, April.
    17. Jianlin Jiang & Su Zhang & Yibing Lv & Xin Du & Ziwei Yan, 2020. "An ADMM-based location–allocation algorithm for nonconvex constrained multi-source Weber problem under gauge," Journal of Global Optimization, Springer, vol. 76(4), pages 793-818, April.
    18. Gregory Dobson & Euthemia Stavrulaki, 2007. "Simultaneous price, location, and capacity decisions on a line of time‐sensitive customers," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(1), pages 1-10, February.
    19. Venkateshan, Prahalad & Ballou, Ronald H. & Mathur, Kamlesh & Maruthasalam, Arulanantha P.P., 2017. "A Two-echelon joint continuous-discrete location model," European Journal of Operational Research, Elsevier, vol. 262(3), pages 1028-1039.
    20. O Berman & Z Drezner, 2007. "The multiple server location problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(1), pages 91-99, January.

    More about this item

    Statistics

    Access and download statistics

    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:wly:navres:v:37:y:1990:i:6:p:929-935. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.