k -most suitable locations problem: greedy search approach

Seyed-Hadi Mirghaderi and Behnam Hassanizadeh

International Journal of Industrial and Systems Engineering, 2022, vol. 42, issue 1, 80-95

Abstract: Facility location problems have been highly considered in the literature and employed in various real-world situations. The k-most suitable locations (k-MSL) problem is a type of site-selection problem, a direction of facility location problems. It can be applied in several areas like disaster management, urban development, telecommunication and franchising corporations. This paper aims to develop heuristics for the problem. It proposes four greedy search algorithms to find solutions for the k-MSL problem and provide a baseline for comparing future solutions. The proposed greedy algorithms solve the problem for all values of k. The computational experiments using real-world datasets reveal that one of the developed algorithms is superior in consuming CPU time, and the other three algorithms provide accurate solutions in low k and good solutions in all values of k in a reasonable time.

Keywords: location science; k -most suitable locations; k -MSL; heuristics; facility location; greedy search. (search for similar items in EconPapers)
Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=126019 (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:ijisen:v:42:y:2022:i:1:p:80-95

Access Statistics for this article

More articles in International Journal of Industrial and Systems Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().