IDEAS home Printed from https://ideas.repec.org/p/iim/iimawp/12808.html
   My bibliography  Save this paper

Multi-Period Facility Location Problem with an Uncertain Number of Servers

Author

Listed:
  • Vatsa, Amit Kumar

Abstract

We study the problem of allocating doctors to primary health centers. We model the prob- lem as a multi-period uncapacitated facility location problem under uncertainty. The problem is unconventional in that the uncertainty is in the number and period of availability of doctors. We use a minmax regret approach to solve the problem. We present solution techniques using local search and tabu search and compare our solutions with optimal solutions obtained using commercial solvers. We see that one of our tabu search algorithms is faster and yields optimal solutions in the problems we tested on.

Suggested Citation

  • Vatsa, Amit Kumar, 2014. "Multi-Period Facility Location Problem with an Uncertain Number of Servers," IIMA Working Papers WP2014-02-06, Indian Institute of Management Ahmedabad, Research and Publication Department.
    • Handle: RePEc:iim:iimawp:12808
    as

    Download full text from publisher

    File URL: https://www.iima.ac.in/sites/default/files/rnpfiles/19161433212014-02-06.pdf
    File Function: English Version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Erlenkotter, Donald, 1981. "A comparative study of approaches to dynamic location problems," European Journal of Operational Research, Elsevier, vol. 6(2), pages 133-143, February.
    2. Killmer, K. A. & Anandalingam, G. & Malcolm, S. A., 2001. "Siting noxious facilities under uncertainty," European Journal of Operational Research, Elsevier, vol. 133(3), pages 596-607, September.
    3. Trevor Hale & Christopher Moberg, 2003. "Location Science Research: A Review," Annals of Operations Research, Springer, vol. 123(1), pages 21-35, October.
    4. Brotcorne, Luce & Laporte, Gilbert & Semet, Frederic, 2003. "Ambulance location and relocation models," European Journal of Operational Research, Elsevier, vol. 147(3), pages 451-463, June.
    5. VAN ROY, Tony J. & ERLENKOTTER, Donald, 1982. "A dual-based procedure for dynamic facility location," LIDAM Reprints CORE 490, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    6. Current, John & Ratick, Samuel & ReVelle, Charles, 1998. "Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach," European Journal of Operational Research, Elsevier, vol. 110(3), pages 597-609, November.
    7. Berman, Oded & Wang, Jiamin, 2011. "The minmax regret gradual covering location problem on a network with incomplete information of demand weights," European Journal of Operational Research, Elsevier, vol. 208(3), pages 233-238, February.
    8. Albareda-Sambola, Maria & Fernández, Elena & Saldanha-da-Gama, Francisco, 2011. "The facility location problem with Bernoulli demands," Omega, Elsevier, vol. 39(3), pages 335-345, June.
    9. Antunes, Antonio & Peeters, Dominique, 2001. "On solving complex multi-period location models using simulated annealing," European Journal of Operational Research, Elsevier, vol. 130(1), pages 190-201, April.
    10. Antunes, Antonio & Peeters, Dominique, 2000. "A dynamic optimization model for school network planning," Socio-Economic Planning Sciences, Elsevier, vol. 34(2), pages 101-120, June.
    11. Tony J. Van Roy & Donald Erlenkotter, 1982. "A Dual-Based Procedure for Dynamic Facility Location," Management Science, INFORMS, vol. 28(10), pages 1091-1105, October.
    12. Berman, Oded & Krass, Dmitry & Drezner, Zvi, 2003. "The gradual covering decay location problem on a network," European Journal of Operational Research, Elsevier, vol. 151(3), pages 474-480, December.
    13. Gunawardane, Gamini, 1982. "Dynamic versions of set covering type public facility location problems," European Journal of Operational Research, Elsevier, vol. 10(2), pages 190-195, June.
    14. George O. Wesolowsky & William G. Truscott, 1975. "The Multiperiod Location-Allocation Problem with Relocation of Facilities," Management Science, INFORMS, vol. 22(1), pages 57-65, September.
    Full references (including those not matched with items on IDEAS)

    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. Vatsa, Amit Kumar & Ghosh, Diptesh, 2014. "Tabu Search for Multi-Period Facility Location: Uncapacitated Problem with an Uncertain Number of Servers," IIMA Working Papers WP2014-11-03, Indian Institute of Management Ahmedabad, Research and Publication Department.
    2. Vatsa, Amit Kumar & Jayaswal, Sachin, 2015. "A New Formulation and Benders' Decomposition for Multi-period facility Location Problem with Server Uncertainty," IIMA Working Papers WP2015-02-07, Indian Institute of Management Ahmedabad, Research and Publication Department.
    3. Vatsa, Amit Kumar & Jayaswal, Sachin, 2016. "A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty," European Journal of Operational Research, Elsevier, vol. 251(2), pages 404-418.
    4. Tang, Lianhua & Li, Yantong & Bai, Danyu & Liu, Tao & Coelho, Leandro C., 2022. "Bi-objective optimization for a multi-period COVID-19 vaccination planning problem," Omega, Elsevier, vol. 110(C).
    5. Sanjay Dominik Jena & Jean-François Cordeau & Bernard Gendron, 2015. "Dynamic Facility Location with Generalized Modular Capacities," Transportation Science, INFORMS, vol. 49(3), pages 484-499, August.
    6. Russell Halper & S. Raghavan, 2011. "The Mobile Facility Routing Problem," Transportation Science, INFORMS, vol. 45(3), pages 413-434, August.
    7. Güden, Hüseyin & Süral, Haldun, 2014. "Locating mobile facilities in railway construction management," Omega, Elsevier, vol. 45(C), pages 71-79.
    8. Allman, Andrew & Zhang, Qi, 2020. "Dynamic location of modular manufacturing facilities with relocation of individual modules," European Journal of Operational Research, Elsevier, vol. 286(2), pages 494-507.
    9. Eric Delmelle & Jean-Claude Thill & Dominique Peeters & Isabelle Thomas, 2014. "A multi-period capacitated school location problem with modular equipment and closest assignment considerations," Journal of Geographical Systems, Springer, vol. 16(3), pages 263-286, July.
    10. Reza Farahani & Zvi Drezner & Nasrin Asgari, 2009. "Single facility location and relocation problem with time dependent weights and discrete planning horizon," Annals of Operations Research, Springer, vol. 167(1), pages 353-368, March.
    11. Hoon Jang, 2019. "Designing capacity rollout plan for neonatal care service system in Korea," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(3), pages 809-830, September.
    12. António Antunes & Oded Berman & João Bigotte & Dmitry Krass, 2009. "A Location Model for Urban Hierarchy Planning with Population Dynamics," Environment and Planning A, , vol. 41(4), pages 996-1016, April.
    13. Jang, Hoon & Hwang, Kyosang & Lee, Taeho & Lee, Taesik, 2019. "Designing robust rollout plan for better rural perinatal care system in Korea," European Journal of Operational Research, Elsevier, vol. 274(2), pages 730-742.
    14. Vatsa, Amit Kumar & Jayaswal, Sachin, 2021. "Capacitated multi-period maximal covering location problem with server uncertainty," European Journal of Operational Research, Elsevier, vol. 289(3), pages 1107-1126.
    15. Shahzad Bhatti & Michael Lim & Ho-Yin Mak, 2015. "Alternative fuel station location model with demand learning," Annals of Operations Research, Springer, vol. 230(1), pages 105-127, July.
    16. Current, John & Ratick, Samuel & ReVelle, Charles, 1998. "Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach," European Journal of Operational Research, Elsevier, vol. 110(3), pages 597-609, November.
    17. Antunes, Antonio & Peeters, Dominique, 2001. "On solving complex multi-period location models using simulated annealing," European Journal of Operational Research, Elsevier, vol. 130(1), pages 190-201, April.
    18. Lei, Chao & Lin, Wei-Hua & Miao, Lixin, 2014. "A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 238(3), pages 699-710.
    19. Drexl, Andreas & Klose, Andreas, 2001. "Facility location models for distribution system design," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 546, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    20. Ivan Contreras & Jean-François Cordeau & Gilbert Laporte, 2011. "The Dynamic Uncapacitated Hub Location Problem," Transportation Science, INFORMS, vol. 45(1), pages 18-32, February.

    More about this item

    Statistics

    Access and download statistics

    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:iim:iimawp:12808. 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: the person in charge (email available below). General contact details of provider: https://edirc.repec.org/data/eciimin.html .

    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.