Advanced Search
MyIDEAS: Login to save this article or follow this journal

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


Author Info

  • Vladimir Marianov

    (Department of Electrical Engineering, Pontificia Universidad Católica de Chile, Santiago, Chile,

  • Daniel Serra

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


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.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL:
Download Restriction: no

Bibliographic Info

Article provided by in its journal International Regional Science Review.

Volume (Year): 34 (2011)
Issue (Month): 3 (July)
Pages: 323-338

as in new window
Handle: RePEc:sae:inrsre:v:34:y:2011:i:3:p:323-338

Contact details of provider:

Related research

Keywords: location; heuristics; queuing and congestion; nonlinear capacitated p-median;


No references listed on IDEAS
You can help add them by filling out this form.



This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.


Access and download statistics


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.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (SAGE Publications).

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 references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.