IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v167y2009i1p337-35210.1007-s10479-008-0341-2.html
   My bibliography  Save this article

The multiple server center location problem

Author

Listed:
  • Robert Aboolian
  • Oded Berman
  • Zvi Drezner

Abstract

In this paper, we introduce the multiple server center location problem. p servers are to be located at nodes of a network. Demand for services of these servers is located at each node, and a subset of nodes are to be chosen to locate one or more servers in each. Each customer selects the closest server. The objective is to minimize the maximum time spent by any customer, including travel time and waiting time at the server sites. The problem is formulated and analyzed. Results for heuristic solution approaches are reported. Copyright Springer Science+Business Media, LLC 2009

Suggested Citation

  • 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.
    • Handle: RePEc:spr:annopr:v:167:y:2009:i:1:p:337-352:10.1007/s10479-008-0341-2
    DOI: 10.1007/s10479-008-0341-2
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-008-0341-2
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-008-0341-2?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. 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.
    2. Qian Wang & Rajan Batta & Christopher Rump, 2002. "Algorithms for a Facility Location Problem with Stochastic Customer Demand and Immobile Servers," Annals of Operations Research, Springer, vol. 111(1), pages 17-34, March.
    3. O. Berman & R. C. Larson & C. Parkan, 1987. "The Stochastic Queue p -Median Problem," Transportation Science, INFORMS, vol. 21(3), pages 207-216, August.
    4. Michael B. Teitz & Polly Bart, 1968. "Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph," Operations Research, INFORMS, vol. 16(5), pages 955-961, October.
    5. Berman, Oded & Mandowsky, Ronald R., 1986. "Location-allocation on congested networks," European Journal of Operational Research, Elsevier, vol. 26(2), pages 238-250, August.
    6. 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.
    7. Oded Berman & Dmitry Krass, 2002. "Recent Developments in the Theory and Applications of Location Models: A Preview," Annals of Operations Research, Springer, vol. 111(1), pages 15-16, March.
    8. Vladimir Marianov & Miguel Ríos, 2000. "A probabilistic quality of service constraint for a location model of switches in ATM communications networks," Annals of Operations Research, Springer, vol. 96(1), pages 237-243, November.
    9. Oded Berman & Dmitry Krass, 2002. "Recent Developments in the Theory and Applications of Location Models: A Preview," Annals of Operations Research, Springer, vol. 110(1), pages 15-16, 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


    Cited by:

    1. Robert Aboolian & Tingting Cui & Zuo-Jun Max Shen, 2013. "An Efficient Approach for Solving Reliable Facility Location Models," INFORMS Journal on Computing, INFORMS, vol. 25(4), pages 720-729, November.
    2. Ebrahim Teimoury & Mohammad Modarres & Morteza Neishaboori, 2020. "Cost-based differential pricing for a make-to-order production system in a competitive segmented market," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 19(4), pages 266-275, August.

    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. 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.
    2. Oded Berman & Zvi Drezner & Arie Tamir & George Wesolowsky, 2009. "Optimal location with equitable loads," Annals of Operations Research, Springer, vol. 167(1), pages 307-325, March.
    3. Boffey, Brian & Galvao, Roberto & Espejo, Luis, 2007. "A review of congestion models in the location of facilities with immobile servers," European Journal of Operational Research, Elsevier, vol. 178(3), pages 643-662, May.
    4. 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.
    5. Sayarshad, Hamid R. & Chow, Joseph Y.J., 2017. "Non-myopic relocation of idle mobility-on-demand vehicles as a dynamic location-allocation-queueing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 60-77.
    6. Hossein Abouee-Mehrizi & Sahar Babri & Oded Berman & Hassan Shavandi, 2011. "Optimizing capacity, pricing and location decisions on a congested network with balking," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 74(2), pages 233-255, October.
    7. Robert Aboolian & Oded Berman & Dmitry Krass, 2012. "Profit Maximizing Distributed Service System Design with Congestion and Elastic Demand," Transportation Science, INFORMS, vol. 46(2), pages 247-261, May.
    8. 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.
    9. Mehrdad Moshtagh & Jafar Fathali & James MacGregor Smith & Nezam Mahdavi-Amiri, 2019. "Finding an optimal core on a tree network with M/G/c/c state-dependent queues," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 89(1), pages 115-142, February.
    10. 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.
    11. Ahmadi-Javid, Amir & Hoseinpour, Pooya, 2019. "Service system design for managing interruption risks: A backup-service risk-mitigation strategy," European Journal of Operational Research, Elsevier, vol. 274(2), pages 417-431.
    12. Owen, Susan Hesse & Daskin, Mark S., 1998. "Strategic facility location: A review," European Journal of Operational Research, Elsevier, vol. 111(3), pages 423-447, December.
    13. H K Smith & G Laporte & P R Harper, 2009. "Locational analysis: highlights of growth to maturity," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 140-148, May.
    14. Prahalad Venkateshan & Kamlesh Mathur, 2015. "A Heuristic for the Multisource Weber Problem with Service Level Constraints," Transportation Science, INFORMS, vol. 49(3), pages 472-483, August.
    15. Simin Huang & Rajan Batta & Rakesh Nagi, 2005. "Distribution network design: Selection and sizing of congested connections," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(8), pages 701-712, December.
    16. Qian Wang & Rajan Batta & Christopher M. Rump, 2004. "Facility location models for immobile servers with stochastic demand," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(1), pages 137-152, February.
    17. O Berman & Z Drezner & D Krass, 2011. "Discrete cooperative covering problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(11), pages 2002-2012, November.
    18. Vladimir Marianov & Daniel Serra, 1996. "Probabilistic maximal covering location-allocation models with constrained waiting time or queue length for congested systems," Economics Working Papers 177, Department of Economics and Business, Universitat Pompeu Fabra.
    19. Marianov, Vladimir & Serra, Daniel & ReVelle, Charles, 1999. "Location of hubs in a competitive environment," European Journal of Operational Research, Elsevier, vol. 114(2), pages 363-371, April.
    20. Michael Brusco & J Dennis Cradit & Douglas Steinley, 2021. "A comparison of 71 binary similarity coefficients: The effect of base rates," PLOS ONE, Public Library of Science, vol. 16(4), pages 1-19, April.

    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:spr:annopr:v:167:y:2009:i:1:p:337-352:10.1007/s10479-008-0341-2. 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.springer.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.