Skip to main content

Advertisement

SpringerLink
Log in

On a facility location problem with applications to tele-diagnostic

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

Consider an undirected graph G modelling a network. Each vertex in the graph contains some physical devices, which can be monitored and possibly repaired from a remote site in case they become faulty. We assume that there can be two kinds of faults in the system: soft faults, which can be repaired remotely from another site (i.e., a monitor), and severe faults which cannot be repaired remotely and require further (possibly human) interventions. We assume that soft faults happen with some fixed probability λ, 0 < λ ≤ 1. We investigate the problem of locating monitors in the network so as to minimize the total expected communication cost per fault. We formalize such a problem as a location problem with a cost function depending on λ and study some properties of the optimal solutions. The latter are exploited for investigating the complexity of the problem and providing efficient approximation algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abrams, M., Standridge, C.R., Abdulla, G., Williams, S., Fox, E.A.: Caching proxies: limitations and potentials. In: Proceedings of the fourth international world wide web conference, Boston, pp. 119–133 (1995)

  2. Arya V., Garg N., Khandekar R., Meyerson A., Munagala K., Pandit V.: Local search heuristics for k–median and facility location problems. SIAM J. Comput. 33, 544–562 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  3. Barish, G., Obraczka, K.: World wide web caching: trends and techniques. In: IEEE communications, internet technology series, pp. 178–185 (2000)

  4. Bollapragada R., Yanjun L., Rao U.S.: Budget-constrained, capacitated hub location to maximize expected demand coverage in fixed-wireless telecommunication networks. INFORMS J. Comput. 18(4), 422–432 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  5. Handler G.Y., Mirchandani P.B.: Location on networks: theory and algorithms. M.I.T Press, Cambridge (1979)

    MATH  Google Scholar 

  6. Hwang H.-S.: A stochastic set-covering location model for both ameliorating and deteriorating items. Comput. Ind. Eng. 46(2), 313–319 (2004)

    Article  Google Scholar 

  7. ICM workshop on web caching, 1995. http://w3cache.icm.edu.pl/workshop/

  8. Jucker J.V., Carlson R.C.: The simple plant-location problem under uncertainty. Oper. Res. 24, 1045–1055 (1977)

    Article  MATH  Google Scholar 

  9. Hajiaghayi M.T., Mahdian M., Mirrokni V.S.: The facility location problem with general cost functions. Networks 42(1), 42–47 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kamal J., Vazirani V.V.: Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation. J. ACM 48(2), 274–296 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kogan K., Khmelnitsky E., Ibaraki T.: Dynamic generalized assignment problems with stochastic demands and multiple agent—task relationships. J. Global Optim. 31(1), 17–43 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  12. Laporte G., Louveaux F.V., Mercure H.: Models and exact solutions for a class of stochastic location-routing problems. Eur. J. Oper. Res. 39(1), 71–78 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  13. Louveaux F.V.: Discrete stochastic location models. Ann. Oper. Res. 6(4), 23–34 (1986)

    Google Scholar 

  14. Louveaux F.V., Peeters D.: A dual-based procedure for stochastic facility location. Oper. Res. 40(3), 564–573 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  15. Love R.F., Morris J.G., Wesolowsky G.O.: Facilities Location: Models and Methods. North Holland, New York (1988)

    MATH  Google Scholar 

  16. Mirchandani P.B., Francis R.L.: Discrete Location Theory. John Wiley and Sons, Inc., New York (1990)

    MATH  Google Scholar 

  17. Whitaker R.M., Hurley S.: On the optimality of facility location for wireless transmission infrastructure. Comput. Ind. Eng. 46(1), 171–191 (2004)

    Article  Google Scholar 

  18. Wang Q., Batta R., Rump C.M.: Facility location models for immobile servers with stochastic demand. Naval Res. Logist. 51(1), 137–152 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  19. Wu L.-Y., Zhang X.-S., Zhang J.-L.: Capacitated facility location problem with general setup cost. Comput. Oper. Res. 33(2), 1226–1241 (2006)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto per le Applicazioni del Calcolo, M. Picone, Via dei Taurini, 19, 00185, Rome, Italy

    N. Apollonio

  2. Dipartimento di Ingegneria dell’Impresa, University of Rome “Tor Vergata”, Viale del Politecnico, 1, 00133, Rome, Italy

    M. Caramia

  3. Dipartimento di Informatica, Sistemi e Produzione, University of Rome “Tor Vergata”, Viale del Politecnico, 1, 00133, Rome, Italy

    G. F. Italiano

Authors
  1. N. Apollonio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Caramia
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. G. F. Italiano
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Caramia.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Apollonio, N., Caramia, M. & Italiano, G.F. On a facility location problem with applications to tele-diagnostic. Optim Lett 7, 1179–1192 (2013). https://doi.org/10.1007/s11590-012-0495-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-012-0495-3

Keywords

Search

Navigation