Minmax Regret Minimum Assignment

2008 ◽  
pp. 113-120
Author(s):  
Adam Kasperski
Keyword(s):  
Minmax Regret

Minmax Regret Maximal Covering Location Problems with Edge Demands

2020 ◽  
pp. 105181
Author(s):  
Marta Baldomero-Naranjo ◽  
Jörg Kalcsics ◽  
Antonio M. Rodríguez-Chía
Keyword(s):  
Location Problems ◽  
Maximal Covering ◽  
Minmax Regret

A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty

2021 ◽  
Author(s):  
Iago A. Carvalho ◽  
Thiago F. Noronha ◽  
Christophe Duhamel ◽  
Luiz F. M. Vieira ◽  
Vinicius F. dos Santos
Keyword(s):  
Shortest Path ◽  
Interval Uncertainty ◽  
Minmax Regret

Minmax-Regret Evacuation Planning for Cycle Networks

2019 ◽  
pp. 42-58
Author(s):  
Robert Benkoczi ◽  
Binay Bhattacharya ◽  
Yuya Higashikawa ◽  
Tsunehiko Kameda ◽  
Naoki Katoh
Keyword(s):  
Evacuation Planning ◽  
Minmax Regret

Parallel Scatter Search Approach for the MinMax Regret Location Problem

2018 ◽  
Vol 9 (2) ◽  
pp. 1-17
Author(s):  
Sarah Ibri ◽  
Mohammed EL Amin Cherabrab ◽  
Nasreddine Abdoune
Keyword(s):  
Location Problem ◽  
Search Algorithm ◽  
Discrete Event ◽  
Scatter Search ◽  
Search Time ◽  
Computation Time ◽  
Minmax Regret ◽  
Search Approach ◽  
Two Stages

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