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

Amit Kumar Vatsa and Diptesh Ghosh ()

No WP2014-11-03, IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department

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.

Date: 2014-11-11
New Economics Papers: this item is included in nep-cmp
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
https://www.iima.ac.in/sites/default/files/rnpfiles/17854973262014-11-03.pdf English Version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:iim:iimawp:12923

Access Statistics for this paper

More papers in IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department Contact information at EDIRC.
Bibliographic data for series maintained by ().