IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v2y1998i3d10.1023_a1009796525600.html
   My bibliography  Save this article

Facility Location with Dynamic Distance Functions

Author

Listed:
  • Randeep Bhatia

    (Bell Labs)

  • Sudipto Guha

    (Stanford University)

  • Samir Khuller

    (University of Maryland)

  • Yoram J. Sussmann

    (University of Maryland)

Abstract

Facility location problems have always been studied with theassumption that the edge lengths in the network are static anddo not change over time. The underlying network could be used to model a city street networkfor emergency facility location/hospitals, or an electronic network for locating information centers. In any case, it is clear that due to trafficcongestion the traversal time on links changes with time. Very often, we have estimates as to how the edge lengths change over time, and our objective is to choose a set of locations (vertices) ascenters, such that at every time instant each vertex has a center close to it (clearly, the center close to a vertex may change over time). We also provide approximation algorithms as well as hardness results forthe K-center problem under this model. This is the first comprehensive study regarding approximation algorithmsfor facility location for good time-invariant solutions.

Suggested Citation

  • Randeep Bhatia & Sudipto Guha & Samir Khuller & Yoram J. Sussmann, 1998. "Facility Location with Dynamic Distance Functions," Journal of Combinatorial Optimization, Springer, vol. 2(3), pages 199-217, September.
  • Handle: RePEc:spr:jcomop:v:2:y:1998:i:3:d:10.1023_a:1009796525600
    DOI: 10.1023/A:1009796525600
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1009796525600
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1023/A:1009796525600?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Constantine Toregas & Ralph Swain & Charles ReVelle & Lawrence Bergman, 1971. "The Location of Emergency Service Facilities," Operations Research, INFORMS, vol. 19(6), pages 1363-1373, October.
    2. Daniel Serra & Vladimir Marianov, 1996. "The P-median problem in a changing network: The case of Barcelona," Economics Working Papers 180, Department of Economics and Business, Universitat Pompeu Fabra.
    3. Arthur Warburton, 1987. "Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems," Operations Research, INFORMS, vol. 35(1), pages 70-79, February.
    4. Refael Hassin, 1992. "Approximation Schemes for the Restricted Shortest Path Problem," Mathematics of Operations Research, INFORMS, vol. 17(1), pages 36-42, February.
    5. Dorit S. Hochbaum & David B. Shmoys, 1985. "A Best Possible Heuristic for the k -Center Problem," Mathematics of Operations Research, INFORMS, vol. 10(2), pages 180-184, May.
    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. Jurij Mihelič & Borut Robič, 2010. "Flexible-attribute problems," Computational Optimization and Applications, Springer, vol. 47(3), pages 553-566, November.
    2. Mihelic, Jurij & Mahjoub, Amine & Rapine, Christophe & Robic, Borut, 2010. "Two-stage flexible-choice problems under uncertainty," European Journal of Operational Research, Elsevier, vol. 201(2), pages 399-403, March.

    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. Xie, Chi & Travis Waller, S., 2012. "Parametric search and problem decomposition for approximating Pareto-optimal paths," Transportation Research Part B: Methodological, Elsevier, vol. 46(8), pages 1043-1067.
    2. Luigi Di Puglia Pugliese & Francesca Guerriero, 2013. "A Reference Point Approach for the Resource Constrained Shortest Path Problems," Transportation Science, INFORMS, vol. 47(2), pages 247-265, May.
    3. Jianping Li & Weidong Li & Junran Lichen, 2014. "The subdivision-constrained routing requests problem," Journal of Combinatorial Optimization, Springer, vol. 27(1), pages 152-163, January.
    4. Arne Herzel & Stefan Ruzika & Clemens Thielen, 2021. "Approximation Methods for Multiobjective Optimization Problems: A Survey," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1284-1299, October.
    5. Goldberg, Noam & Poss, Michael, 2020. "Maximum probabilistic all-or-nothing paths," European Journal of Operational Research, Elsevier, vol. 283(1), pages 279-289.
    6. Sourour Elloumi & Martine Labbé & Yves Pochet, 2004. "A New Formulation and Resolution Method for the p-Center Problem," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 84-94, February.
    7. Alexandre Dolgui & Mikhail Y. Kovalyov & Alain Quilliot, 2018. "Simple paths with exact and forbidden lengths," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(1), pages 78-85, February.
    8. Li, Jianping & Ge, Yu & He, Shuai & Lichen, Junran, 2014. "Approximation algorithms for constructing some required structures in digraphs," European Journal of Operational Research, Elsevier, vol. 232(2), pages 307-314.
    9. Li Guan & Jianping Li & Weidong Li & Junran Lichen, 2019. "Improved approximation algorithms for the combination problem of parallel machine scheduling and path," Journal of Combinatorial Optimization, Springer, vol. 38(3), pages 689-697, October.
    10. Nir Halman & Mikhail Y. Kovalyov & Alain Quilliot & Dvir Shabtay & Moshe Zofi, 2019. "Bi-criteria path problem with minimum length and maximum survival probability," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(2), pages 469-489, June.
    11. V Marianov & F Fresard, 2005. "A procedure for the strategic planning of locations, capacities and districting of jails: application to Chile," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(3), pages 244-251, March.
    12. Strehler, Martin & Merting, Sören & Schwan, Christian, 2017. "Energy-efficient shortest routes for electric and hybrid vehicles," Transportation Research Part B: Methodological, Elsevier, vol. 103(C), pages 111-135.
    13. James H. Lambert & Mark W. Farrington, 2006. "Risk‐Based Objectives for the Allocation of Chemical, Biological, and Radiological Air Emissions Sensors," Risk Analysis, John Wiley & Sons, vol. 26(6), pages 1659-1674, December.
    14. Mark M. Nejad & Lena Mashayekhy & Daniel Grosu & Ratna Babu Chinnam, 2017. "Optimal Routing for Plug-In Hybrid Electric Vehicles," Transportation Science, INFORMS, vol. 51(4), pages 1304-1325, November.
    15. Roberto Aringhieri & Giuliana Carello & Daniela Morale, 2016. "Supporting decision making to improve the performance of an Italian Emergency Medical Service," Annals of Operations Research, Springer, vol. 236(1), pages 131-148, January.
    16. Karl Schneeberger & Karl Doerner & Andrea Kurz & Michael Schilde, 2016. "Ambulance location and relocation models in a crisis," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 24(1), pages 1-27, March.
    17. Davood Shishebori & Lawrence Snyder & Mohammad Jabalameli, 2014. "A Reliable Budget-Constrained FL/ND Problem with Unreliable Facilities," Networks and Spatial Economics, Springer, vol. 14(3), pages 549-580, December.
    18. Barbara Anthony & Vineet Goyal & Anupam Gupta & Viswanath Nagarajan, 2010. "A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems," Mathematics of Operations Research, INFORMS, vol. 35(1), pages 79-101, February.
    19. P. Daniel Wright & Matthew J. Liberatore & Robert L. Nydick, 2006. "A Survey of Operations Research Models and Applications in Homeland Security," Interfaces, INFORMS, vol. 36(6), pages 514-529, December.
    20. Jiwon Baik & Alan T. Murray, 2022. "Locating a facility to simultaneously address access and coverage goals," Papers in Regional Science, Wiley Blackwell, vol. 101(5), pages 1199-1217, October.

    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:spr:jcomop:v:2:y:1998:i:3:d:10.1023_a:1009796525600. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.