Help
Cart
Skip main navigation

Available Issues

April 10, 2013 - May 13, 2026

Available Issues

April 10, 2013 - May 13, 2026

A Heuristic for the Multisource Weber Problem with Service Level Constraints

Published Online:4 Sep 2014https://doi.org/10.1287/trsc.2014.0547

References

  • Batta R, Berman O (1989) A location model for a facility operating as an M/G/k queue. Networks 19:717–728.Crossref, Google Scholar
  • Berman O, Krass D (2002) Facility location problems with stochastic demands and congestion. Drezner Z, Hamacher HW, eds. Facility Location: Applications and Theory (Springer-Verlag, Berlin), 329–371.Crossref, Google Scholar
  • Berman O, Larson RC (1985) Optimal 2-facility network districting in the presence of queueing. Transportation Sci. 19:261–277.Link, Google Scholar
  • Berman O, Mandowsky RR (1986) Location-allocation on congested networks. Eur. J. Oper. Res. 26:238–250.Crossref, Google Scholar
  • Berman O, Vasudeva S (2005) Approximating performance measures for public services. IEEE Trans. Syst., Man, Cybernetics—Part A: Syst. Humans 35:583–591.Crossref, Google Scholar
  • Berman O, Larson RC, Chiu SS (1985) Optimal server location on a network operating as an M/G/1 queue. Oper. Res. 33:746–771.Link, Google Scholar
  • Bongartz I, Calamai PH, Conn AR (1994) A projection model for lp norm location-allocation problems. Math. Programming 66:283–312.Crossref, Google Scholar
  • Borst SC, Mandelbaum A, Reiman MI (2004) Dimensioning large call centers. Oper. Res. 52:17–34.Link, Google Scholar
  • Brimberg J, Love RF (1998) Solving a class of two-dimensional uncapacitated location-allocation problems by dynamic programming. Oper. Res. 46:702–709.Link, Google Scholar
  • Brimberg J, Mladenovic N (1996a) Solving the continuous location-allocation problem with tabu search. Stud. Locational Anal. 8:23–32.Google Scholar
  • Brimberg J, Mladenovic N (1996b) A variable neighborhood algorithm for solving the continuous location-allocation problem. Stud. Locational Anal. 10:1–12.Google Scholar
  • Brimberg J, Hansen P, Mladenovic N, Taillard ED (2000) Improvements and comparison of heuristics for solving the uncapacitated multisource Weber problem. Oper. Res. 48:444–460.Link, Google Scholar
  • Chen P, Hansen P, Jaumard B, Tuy H (1998) Solution of the multisource Weber and conditional Weber problems by d.-c. programming. Oper. Res. 46:548–562.Link, Google Scholar
  • Chen R (1983) Solution of minisum and minimax location-allocation problems with Euclidean distances. Naval Res. Logist. Quart. 30:449–459.Crossref, Google Scholar
  • Church R, ReVelle C (1974) The maximal covering location problem. Papers Regional Sci. Assoc. 32:101–118.Crossref, Google Scholar
  • Cooper L (1964) Heuristic methods for location-allocation problems. SIAM Rev. 6:37–53.Crossref, Google Scholar
  • Cooper L (1967) Solutions of generalized locational equilibrium models. J. Regional Sci. 7:1–18.Crossref, Google Scholar
  • Daskin M (1983) A maximum expected covering location model: Formulation, properties and heuristic solution. Transportation Sci. 17:48–70.Link, Google Scholar
  • Drezner Z (1984) The two-center and two median problems. Transportation Sci. 18:351–361.Link, Google Scholar
  • Drezner Z, Mehrez A, Wesolowsky GO (1991) The facility location problem with limited distances. Transportation Sci. 25:183–187.Link, Google Scholar
  • Drezner Z, Klamroth K, Schobel A, Wesolowsky GO (2002) The Weber problem. Drezner Z, Hamacher HW, eds. Facility Location: Applications and Theory (Springer-Verlag, Berlin), 1–36.Crossref, Google Scholar
  • Gans N, Koole G, Mendelbaum A (2003) Telephone call centers: Tutorial, review, and research prospects. Manufacturing Service Oper. Management 5:79–141.Link, Google Scholar
  • Jarvis J (1985) Approximating the equilibrium behaviour of multi-server loss systems. Management Sci. 31:235–239.Link, Google Scholar
  • Krau S (1997) Extensions du probleme de Weber. Doctoral dissertation, Ecole Polytechnique de Montreal, Montreal.Google Scholar
  • Kuenne RE, Soland RM (1972) Exact and approximate solutions to the multisource Weber problem. Math. Programming 3:193–209.Crossref, Google Scholar
  • Larson RC (1974) A hypercube queueing model for facility location and redistricting in urban emergency services. Comput. Oper. Res. 1:67–95.Crossref, Google Scholar
  • Larson RC (1975) Approximating the performance of urban emergency service systems. Oper. Res. 23:845–868.Link, Google Scholar
  • Love RF (1976) One-dimensional facility location-allocation using dynamic programming. Management Sci. 22:614–617.Link, Google Scholar
  • Love RF, Juel H (1982) Properties and solutions methods for large location-allocation problems. J. Oper. Res. Soc. 33:443–452.Google Scholar
  • Love RF, Morris JG (1975) A computational procedure for the exact solution of location-allocation problems with rectangular distances. Naval Res. Logist. Quart. 22:441–453.Crossref, Google Scholar
  • Marianov V, ReVelle C (1996) The queueing maximal availability location problem: A model for the siting of emergency vehicles. Eur. J. Oper. Res. 93:110–120.Crossref, Google Scholar
  • Moreno J, Rodriguez C, Jimenez N (1990) Heuristic cluster algorithm for multiple facility location-allocation problem. Oper. Res. 25:97–107.Google Scholar
  • Ostresh L Jr (1973) TWAIN—Exact solutions to the two source location-allocation problem. Rushton G, Goodchild MF, Ostresh L Jr, eds. Computer Programs for Location-Allocation Problems, Monograph Number 6. Department of Geography (University of Iowa, Iowa City), 15–28.Google Scholar
  • Ostresh L Jr (1975) An efficient algorithm for solving the two center location-allocation problem. J. Regional Sci. 15:209–216.Crossref, Google Scholar
  • Ozsen L, Coullard CR, Daskin MS (2008) Capacitated warehouse location model with risk pooling. Naval Res. Logist. 55:295–312.Crossref, Google Scholar
  • ReVelle C, Hogan K (1989) The maximum reliability location problem and α-reliable p-center problem: Derivatives of the probabilistic location set covering problem. Ann. Oper. Res. 18:155–174.Crossref, Google Scholar
  • Righini G, Zaniboni L (2007) A branch-and-price algorithm for the multi-source Weber problem. Internat. J. Oper. Res. 2:188–207.Crossref, Google Scholar
  • Rosing KE (1992) An optimal method for solving the (generalized) multi-Weber problem. Eur. J. Oper. Res. 58:414–426.Crossref, Google Scholar
  • Shen ZM, Coullard C, Daskin MS (2003) A joint location-inventory model. Transportation Sci. 37:40–55.Link, Google Scholar
  • Sullivan PJ, Peters N (1980) A flexible user oriented location-allocation algorithm. J. Environ. Management 10:181–193.Google Scholar
  • Venkateshan P, Mathur K, Ballou RH (2010) Locating and staffing service centers under service level constraints. Eur. J. Oper. Res. 201:55–70.Crossref, Google Scholar
  • White J, Case K (1974) On covering problems and the central facility location problem. Geographical Anal. 6:281–293.Crossref, Google Scholar
  • Whitt W (1992) Understanding the efficiency of multi-server service systems. Management Sci. 38:708–723.Link, Google Scholar
  • Whitt W (2004) A diffusion approximation for the G/GI/n/m queue. Oper. Res. 2:922–941.Link, Google Scholar
Previous
Back to Top
Next
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.
Agree