Voir la notice de l'article provenant de la source Numdam
Facility location is a critical component of strategic planning for public and private firms. Due to high cost of facility location, making decisions for such a problem has become an important issue which have gained a large deal of attention from researchers. This study examined the gradual maximal covering location problem with variable radius over multiple time periods. In gradual covering location problem, it is assumed that full coverage is replaced by a coverage function, so that increasing the distance from the facility decreases the amount of demand coverage. In variable radius covering problems, however, each facility is considered to have a fixed cost along with a variable cost which has a direct impact on the coverage radius. In real-world problems, since demand may change over time, necessitating relocation of the facilities, the problem can be formulated over multiple time periods. In this study, a mixed integer programming model was presented in which not only facility capacity was considered, but also two objectives were followed: coverage maximization and relocation cost minimization. A metaheuristic algorithm was presented to solve the maximal covering location problem. A simulated annealing algorithm was proposed, with its results presented. Computational results and comparisons demonstrated good performance of the simulated annealing algorithm.
Eydi, Alireza 1 ; Mohebi, Javad 1
@article{RO_2018__52_4-5_1245_0,
author = {Eydi, Alireza and Mohebi, Javad},
title = {Modeling and solution of maximal covering problem considering gradual coverage with variable radius over multi-periods},
journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
pages = {1245--1260},
publisher = {EDP-Sciences},
volume = {52},
number = {4-5},
year = {2018},
doi = {10.1051/ro/2018026},
zbl = {1411.90199},
mrnumber = {3884157},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.1051/ro/2018026/}
}
TY - JOUR AU - Eydi, Alireza AU - Mohebi, Javad TI - Modeling and solution of maximal covering problem considering gradual coverage with variable radius over multi-periods JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2018 SP - 1245 EP - 1260 VL - 52 IS - 4-5 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/articles/10.1051/ro/2018026/ DO - 10.1051/ro/2018026 LA - en ID - RO_2018__52_4-5_1245_0 ER -
%0 Journal Article %A Eydi, Alireza %A Mohebi, Javad %T Modeling and solution of maximal covering problem considering gradual coverage with variable radius over multi-periods %J RAIRO - Operations Research - Recherche Opérationnelle %D 2018 %P 1245-1260 %V 52 %N 4-5 %I EDP-Sciences %U http://geodesic.mathdoc.fr/articles/10.1051/ro/2018026/ %R 10.1051/ro/2018026 %G en %F RO_2018__52_4-5_1245_0
Eydi, Alireza; Mohebi, Javad. Modeling and solution of maximal covering problem considering gradual coverage with variable radius over multi-periods. RAIRO - Operations Research - Recherche Opérationnelle, Tome 52 (2018) no. 4-5, pp. 1245-1260. doi: 10.1051/ro/2018026
Cité par Sources :