Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network

Author(s):  
Binay Bhattacharya ◽  
Tsunehiko Kameda
Keyword(s):  
2020 ◽  
pp. 105181
Author(s):  
Marta Baldomero-Naranjo ◽  
Jörg Kalcsics ◽  
Antonio M. Rodríguez-Chía

Author(s):  
Iago A. Carvalho ◽  
Thiago F. Noronha ◽  
Christophe Duhamel ◽  
Luiz F. M. Vieira ◽  
Vinicius F. dos Santos

Author(s):  
Robert Benkoczi ◽  
Binay Bhattacharya ◽  
Yuya Higashikawa ◽  
Tsunehiko Kameda ◽  
Naoki Katoh

2018 ◽  
Vol 9 (2) ◽  
pp. 1-17
Author(s):  
Sarah Ibri ◽  
Mohammed EL Amin Cherabrab ◽  
Nasreddine Abdoune

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.


Sign in / Sign up

Export Citation Format

Share Document