k-most suitable locations problem: greedy search approach
by Seyed-Hadi Mirghaderi; Behnam Hassanizadeh
International Journal of Industrial and Systems Engineering (IJISE), Vol. 42, No. 1, 2022

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.

Online publication date: Fri, 07-Oct-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com