We consider a few types of heuristics, namely, add-drop-interchange, Lagrangean relaxation-based and random rounding heuristics for the capacitated facility location problem. Some instances of the problem are constructed and performance, with respect to such instances, of the heuristics is studied. It is observed that, performance of the heuristics is often not satisfactory. The instances presented in this article may be used as some critical instances to test heuristics for the problem.
Capacitated facility location problem Heuristics Problem instances
This is a preview of subscription content, log in to check access.
We thank the reviewer very much for the suggestions to improve the article. We thank all who have helped directly and indirectly in writing it.
Avella, P., Boccia, M., Sforza, A., Vasilev, I.: An effective heuristic for large-scale capacitated facility location problems. J. Heuristics 15, 597–615 (2009)CrossRefGoogle Scholar