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

Tabu Search for Multi-Period Facility Location: Uncapacitated Problem with an Uncertain Number of Servers

Author

Listed:
  • Vatsa, Amit Kumar
  • Ghosh, Diptesh

Abstract

This paper supersedes the work presented in WP.No.2014-02-06. We study the problem of allocating doctors to primary health centers (PHC). We model the problem 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. This work aims to determine the sequence of opening facil- ities (assigning doctors to the PHC) over multiple periods so as to cover the maximum demand. We use a minmax regret approach to solve the problem under uncertainty. We present solution techniques using 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 & 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.
  • Handle: RePEc:iim:iimawp:12923
    as

    Download full text from publisher

    File URL: https://web.iima.ac.in/assets/snippets/workingpaperpdf/17854973262014-11-03.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. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. Taillard, E., 1990. "Some efficient heuristic methods for the flow shop sequencing problem," European Journal of Operational Research, Elsevier, vol. 47(1), pages 65-74, July.
    9. 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.
    10. 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.
    11. 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.
    12. 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.
    13. 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)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:12923. 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: (). General contact details of provider: http://edirc.repec.org/data/eciimin.html .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.