Parallel Scatter Search Approach for the MinMax Regret Location Problem

Sarah Ibri, Mohammed EL Amin Cherabrab and Nasreddine Abdoune
Additional contact information
Sarah Ibri: Hassiba Benbouali University, Chlef , Algeria
Mohammed EL Amin Cherabrab: Hassiba Benbouali University, Chlef, Algeria
Nasreddine Abdoune: Hassiba Benbouali University, Chlef, Algeria

International Journal of Applied Metaheuristic Computing (IJAMC), 2018, vol. 9, issue 2, 1-17

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.

Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 018/IJAMC.2018040101 (application/pdf)

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:igg:jamc00:v:9:y:2018:i:2:p:1-17

Access Statistics for this article

International Journal of Applied Metaheuristic Computing (IJAMC) is currently edited by Peng-Yeng Yin

More articles in International Journal of Applied Metaheuristic Computing (IJAMC) from IGI Global
Bibliographic data for series maintained by Journal Editor ().