IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v9y2018i2p1-17.html
   My bibliography  Save this article

Parallel Scatter Search Approach for the MinMax Regret Location Problem

Author

Listed:
  • Sarah Ibri

    (Hassiba Benbouali University, Chlef , Algeria)

  • Mohammed EL Amin Cherabrab

    (Hassiba Benbouali University, Chlef, Algeria)

  • Nasreddine Abdoune

    (Hassiba Benbouali University, Chlef, Algeria)

Abstract

In this paper we propose an efficient solving method based on a parallel scatter search algorithm that accelerates the search time to solve the minmax regret location problem. The algorithm was applied in the context of emergency management to locate emergency vehicles stations. A discrete event simulator was used to test the quality of the obtained solutions on the operational level. We compared the performance of the algorithm to an existing two stages method, and experiments show the efficiency of the proposed method in terms of quality of solution as well as the gain in computation time that could be obtained by parallelizing the proposed algorithm.

Suggested Citation

  • Sarah Ibri & Mohammed EL Amin Cherabrab & Nasreddine Abdoune, 2018. "Parallel Scatter Search Approach for the MinMax Regret Location Problem," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 9(2), pages 1-17, April.
    • Handle: RePEc:igg:jamc00:v:9:y:2018:i:2:p:1-17
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.2018040101
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:igg:jamc00:v:9:y:2018:i:2:p:1-17. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.