Location of Multiple-Server Common Service Centers or Facilities, for Minimizing General Congestion and Travel Cost Functions
Vladimir Marianov and
Daniel Serra ()
Additional contact information
Vladimir Marianov: Department of Electrical Engineering, Pontificia Universidad Católica de Chile, Santiago, Chile, marianov@ing.puc.cl
International Regional Science Review, 2011, vol. 34, issue 3, 323-338
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.
Keywords: location; heuristics; queuing and congestion; nonlinear capacitated p-median (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)
Downloads: (external link)
https://journals.sagepub.com/doi/10.1177/0160017611403738 (text/html)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:sae:inrsre:v:34:y:2011:i:3:p:323-338
DOI: 10.1177/0160017611403738
Access Statistics for this article
More articles in International Regional Science Review
Bibliographic data for series maintained by SAGE Publications ().