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

The multiple server location problem

Author

Listed:
  • O Berman

    (University of Toronto)

  • Z Drezner

    (California State University-Fullerton)

Abstract

In this paper, we introduce the Multiple Server location problem. A given number of servers are to be located at nodes of a network. Demand for these servers is generated at each node, and a subset of nodes need to be selected for locating one or more servers in each. There is no limit on the number of servers that can be established at each node. Each customer at a node selects the closest server (with demand divided equally when the closest distance is measured to more than one node). The objective is to minimize the sum of the travel time and the average time spent at the server, for all customers. The problem is formulated and analysed. Results using heuristic solution procedures: descent, simulated annealing, tabu search and a genetic algorithm are reported. The problem turns out to be a very difficult combinatorial problem when the total demand is very close to the total capacity of the servers.

Suggested Citation

  • 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.
    • Handle: RePEc:pal:jorsoc:v:58:y:2007:i:1:d:10.1057_palgrave.jors.2602126
    DOI: 10.1057/palgrave.jors.2602126
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2602126
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2602126?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. Drezner, Zvi & Wesolowsky, George O., 1996. "Location-allocation on a line with demand-dependent costs," European Journal of Operational Research, Elsevier, vol. 90(3), pages 444-450, May.
    2. Zvi Drezner, 1988. "Note: On the Pooling of Services," Interfaces, INFORMS, vol. 18(2), pages 108-110, April.
    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. Vladimir Marianov & Daniel Serra, 1994. "Probabilistic maximal covering location models for congested systems," Economics Working Papers 70, Department of Economics and Business, Universitat Pompeu Fabra.
    5. 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.
    6. 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.
    7. M. E. Dyer & L. G. Proll, 1977. "Note--On the Validity of Marginal Analysis for Allocating Servers in M/M/c Queues," Management Science, INFORMS, vol. 23(9), pages 1019-1022, May.
    8. Osman Alp & Erhan Erkut & Zvi Drezner, 2003. "An Efficient Genetic Algorithm for the p-Median Problem," Annals of Operations Research, Springer, vol. 122(1), pages 21-42, September.
    9. Oded Berman, 2002. "Locating Service Facilities to Reduce Lost Demand," Computing in Economics and Finance 2002 367, Society for Computational Economics.
    10. Berman, Oded & Mandowsky, Ronald R., 1986. "Location-allocation on congested networks," European Journal of Operational Research, Elsevier, vol. 26(2), pages 238-250, August.
    11. 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.
    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. 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.
    2. Opher Baron & Oded Berman & Yael Deutsch, 2018. "On the optimality of the sequential approach for network design problems of service operations," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(5), pages 363-377, August.
    3. 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.
    4. 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.
    5. Qianli Zhang & Haijun Mao, 2022. "An Integrated Method for Locating Logistic Centers in a Rural Area," Sustainability, MDPI, vol. 14(9), pages 1-19, May.
    6. Eleftherios Anastasiadis & Panagiotis Angeloudis & Daniel Ainalis & Qiming Ye & Pei-Yuan Hsu & Renos Karamanis & Jose Escribano Macias & Marc Stettler, 2020. "On the Selection of Charging Facility Locations for EV-Based Ride-Hailing Services: A Computational Case Study," Sustainability, MDPI, vol. 13(1), pages 1-16, December.
    7. 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.
    8. Mahmoud Golabi & Seyed Mahdi Shavarani & Gokhan Izbirak, 2017. "An edge-based stochastic facility location problem in UAV-supported humanitarian relief logistics: a case study of Tehran earthquake," Natural Hazards: Journal of the International Society for the Prevention and Mitigation of Natural Hazards, Springer;International Society for the Prevention and Mitigation of Natural Hazards, vol. 87(3), pages 1545-1565, July.
    9. 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.
    10. 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.
    11. Tran, Cong Quoc & Keyvan-Ekbatani, Mehdi & Ngoduy, Dong & Watling, David, 2021. "Stochasticity and environmental cost inclusion for electric vehicles fast-charging facility deployment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 154(C).
    12. Jee Eun Kang & Will Recker, 2015. "Strategic Hydrogen Refueling Station Locations with Scheduling and Routing Considerations of Individual Vehicles," Transportation Science, INFORMS, vol. 49(4), pages 767-783, November.

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    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. 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.
    8. 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.
    9. 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.
    10. Sachin Jayaswal & Navneet Vidyarthi, 2017. "Facility location under service level constraints for heterogeneous customers," Annals of Operations Research, Springer, vol. 253(1), pages 275-305, June.
    11. Opher Baron & Oded Berman & Dmitry Krass, 2008. "Facility Location with Stochastic Demand and Constraints on Waiting Time," Manufacturing & Service Operations Management, INFORMS, vol. 10(3), pages 484-505, August.
    12. 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.
    13. 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.
    14. Samir Elhedhli, 2006. "Service System Design with Immobile Servers, Stochastic Demand, and Congestion," Manufacturing & Service Operations Management, INFORMS, vol. 8(1), pages 92-97, December.
    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. Zvi Drezner & Carlton Scott, 2010. "Optimizing the Location of a Production Firm," Networks and Spatial Economics, Springer, vol. 10(3), pages 411-425, September.
    17. Jayaswal, Sachin, 2014. "Emergency Medical Service System Design under Service Level Constraints for Heterogeneous Patients," IIMA Working Papers WP2014-11-04, Indian Institute of Management Ahmedabad, Research and Publication Department.
    18. Sourirajan, Karthik & Ozsen, Leyla & Uzsoy, Reha, 2009. "A genetic algorithm for a single product network design model with lead time and safety stock considerations," European Journal of Operational Research, Elsevier, vol. 197(2), pages 599-608, September.
    19. Daniel Serra & Francisco Silva, 2002. "Locating emergency services with priority rules: The priority queuing covering location problem," Economics Working Papers 642, Department of Economics and Business, Universitat Pompeu Fabra, revised May 2008.
    20. 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.

    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:58:y:2007:i:1:d:10.1057_palgrave.jors.2602126. 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.