Performance of an add-drop-interchange heuristic for the capacitated facility location problem

Pritibhushan Sinha

International Journal of Applied Management Science, 2009, vol. 1, issue 4, 388-400

Abstract: In this article, we present a heuristic method for solving instances of the capacitated facility location problem. In the method, first, a linear programming relaxation, a transportation problem, is solved to obtain an initial solution. This also gives a lower bound of an optimal solution of the capacitated facility location problem instance. The initial solution is improved in subsequent iterations. In each iteration all possible single-exchange add, drop or interchange of the facilities are considered. Without solving the resultant transportation problems exactly, an approximate method is used for the purpose. Some asymptotic conditions when the method would give an optimal solution are given. Average performance of the method, with respect to the quality of the solutions, has been investigated with benchmark and random instances of the problem. An optimal solution is obtained for most of the benchmark instances. For random instances also, performance of the method is satisfactory.

Keywords: capacitated facility location problem; CFLP; heuristics; facilities location. (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=26199 (text/html)
Access to full text is restricted to subscribers.

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:ids:injams:v:1:y:2009:i:4:p:388-400

Access Statistics for this article

More articles in International Journal of Applied Management Science from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().