IDEAS home Printed from https://ideas.repec.org/a/ids/ijisen/v42y2022i1p80-95.html
   My bibliography  Save this article

k -most suitable locations problem: greedy search approach

Author

Listed:
  • Seyed-Hadi Mirghaderi
  • Behnam Hassanizadeh

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.

Suggested Citation

  • Seyed-Hadi Mirghaderi & Behnam Hassanizadeh, 2022. "k -most suitable locations problem: greedy search approach," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 42(1), pages 80-95.
    • Handle: RePEc:ids:ijisen:v:42:y:2022:i:1:p:80-95
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=126019
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijisen:v:42:y:2022:i:1:p:80-95. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=188 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.