IDEAS home Printed from https://ideas.repec.org/a/sae/inrsre/v34y2011i3p323-338.html
   My bibliography  Save this article

Location of Multiple-Server Common Service Centers or Facilities, for Minimizing General Congestion and Travel Cost Functions

Author

Listed:
  • Vladimir Marianov

    (Department of Electrical Engineering, Pontificia Universidad Católica de Chile, Santiago, Chile, marianov@ing.puc.cl)

  • Daniel Serra

    (Department of Economics and Business, and GREL-IET, Universitat Pompeu Fabra, Barcelona, Spain)

Abstract

The authors propose a model for locating a fixed number of multiple-server service centers or facilities that may become congested. Customers arriving at these centers must wait in line until served. The locations of the facilities and the allocations of customers to them are chosen by the planner, so to minimize both travel costs and system-wide congestion (or queuing) at centers. All the customers arriving at the facilities must be served, up to a certain maximum line length. The travel cost in which customers incur is a function of the length of the trip to the facility, while the congestion cost at a facility is a general function of the number of customers waiting on line or being served at the facility. The resulting model is a nonlinear p-median formulation. A solution method for this nonlinear model is proposed, and computational experience is presented.

Suggested Citation

  • Vladimir Marianov & Daniel Serra, 2011. "Location of Multiple-Server Common Service Centers or Facilities, for Minimizing General Congestion and Travel Cost Functions," International Regional Science Review, , vol. 34(3), pages 323-338, July.
    • Handle: RePEc:sae:inrsre:v:34:y:2011:i:3:p:323-338
    DOI: 10.1177/0160017611403738
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/0160017611403738
    Download Restriction: no
    File URL: https://libkey.io/10.1177/0160017611403738?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. Michel Gendreau & Alain Hertz & Gilbert Laporte, 1994. "A Tabu Search Heuristic for the Vehicle Routing Problem," Management Science, INFORMS, vol. 40(10), pages 1276-1290, October.
    2. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    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. Rajan Batta & June M. Dolan & Nirup N. Krishnamurthy, 1989. "The Maximal Expected Covering Location Problem: Revisited," Transportation Science, INFORMS, vol. 23(4), pages 277-287, November.
    5. D Serra & H A Eiselt & G Laporte & C S ReVelle, 1999. "Market Capture Models under Various Customer-Choice Rules," Environment and Planning B, , vol. 26(5), pages 741-750, October.
    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. Alan T. Murray & Richard L. Church, 2011. "Introduction to the ISOLDE X Special Issue," International Regional Science Review, , vol. 34(3), pages 283-284, July.
    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.

    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. Nair, D.J. & Grzybowska, H. & Fu, Y. & Dixit, V.V., 2018. "Scheduling and routing models for food rescue and delivery operations," Socio-Economic Planning Sciences, Elsevier, vol. 63(C), pages 18-32.
    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. Olli Bräysy & Michel Gendreau, 2002. "Tabu Search heuristics for the Vehicle Routing Problem with Time Windows," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 10(2), pages 211-237, December.
    4. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    5. Van Woensel, T. & Kerbache, L. & Peremans, H. & Vandaele, N., 2008. "Vehicle routing with dynamic travel times: A queueing approach," European Journal of Operational Research, Elsevier, vol. 186(3), pages 990-1007, May.
    6. Joaquín Pacheco & Rafael Caballero & Manuel Laguna & Julián Molina, 2013. "Bi-Objective Bus Routing: An Application to School Buses in Rural Areas," Transportation Science, INFORMS, vol. 47(3), pages 397-411, August.
    7. Balcik, Burcu, 2017. "Site selection and vehicle routing for post-disaster rapid needs assessment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 101(C), pages 30-58.
    8. Sadan Kulturel-Konak & Bryan A. Norman & David W. Coit & Alice E. Smith, 2004. "Exploiting Tabu Search Memory in Constrained Problems," INFORMS Journal on Computing, INFORMS, vol. 16(3), pages 241-254, August.
    9. Ouzineb, Mohamed & Nourelfath, Mustapha & Gendreau, Michel, 2008. "Tabu search for the redundancy allocation problem of homogenous series–parallel multi-state systems," Reliability Engineering and System Safety, Elsevier, vol. 93(8), pages 1257-1272.
    10. Paolo Toth & Daniele Vigo, 2003. "The Granular Tabu Search and Its Application to the Vehicle-Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 15(4), pages 333-346, November.
    11. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
    12. Sheu Chen, 2010. "A Heuristic Algorithm for Hierarchical Hub-and-spoke Network of Time-definite Common Carrier Operation Planning Problem," Networks and Spatial Economics, Springer, vol. 10(4), pages 509-523, December.
    13. Taillard, Eric D. & Gambardella, Luca M. & Gendreau, Michel & Potvin, Jean-Yves, 2001. "Adaptive memory programming: A unified view of metaheuristics," European Journal of Operational Research, Elsevier, vol. 135(1), pages 1-16, November.
    14. LECLUYSE, C. & VAN WOENSEL, Tom & PEREMANS, Herbert, 2007. "Vehicle routing with stochastic time-dependent travel times," Working Papers 2007018, University of Antwerp, Faculty of Business and Economics.
    15. Alice E. Smith, 2021. "Note from the Editor," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1259-1261, October.
    16. Brandao, Jose & Mercer, Alan, 1997. "A tabu search algorithm for the multi-trip vehicle routing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 100(1), pages 180-191, July.
    17. Keskin, Burcu B. & Uster, Halit, 2007. "Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem," European Journal of Operational Research, Elsevier, vol. 182(2), pages 663-682, October.
    18. Crainic, Teodor Gabriel & Laporte, Gilbert, 1997. "Planning models for freight transportation," European Journal of Operational Research, Elsevier, vol. 97(3), pages 409-438, March.
    19. 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.
    20. Lai, David S.W. & Caliskan Demirag, Ozgun & Leung, Janny M.Y., 2016. "A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 86(C), pages 32-52.

    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:sae:inrsre:v:34:y:2011:i:3:p:323-338. 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: SAGE Publications (email available below). General contact details of provider: .

    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.