An Exponential Neighborhood Local Search Algorithm for the Single Row Facility Location Problem

Diptesh Ghosh ()

No WP2011-08-01, IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department

Abstract: In this work we present a local search algorithm for the single row facility location problem. In contrast to other local search algorithms for the problem, our algorithm uses an exponential neighborhood structure. Our computations indicate that our local search algorithm generates solutions to benchmark instances of the problem whose costs are on average within 2% of costs of optimal solutions within reasonable execution time.

Date: 2011-08-09
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://www.iima.ac.in/sites/default/files/rnpfiles/18181451862011-08-01.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:10672

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