Modeling and solving the dynamic modular capacitated maximal covering location problem

Maximal covering location problem is one of the most important network location problems that is used in various applications. To improve the application of the maximal covering location problem (MCLP), several capacitated MCLP models were proposed. However, most of these models assume only one fixe...

Full description

Bibliographic Details
Main Authors: Jafar Bagherinejad, Mehdi Bashiri, Roqayeh Alizadeh
Format: Article
Language:fas
Published: University of Isfahan 2018-01-01
Series:مدیریت تولید و عملیات
Subjects:
Online Access:http://jpom.ui.ac.ir/article_22384_2ce2f21923b6f2e0c269c70df6d34bc5.pdf
_version_ 1797728172065685504
author Jafar Bagherinejad
Mehdi Bashiri
Roqayeh Alizadeh
author_facet Jafar Bagherinejad
Mehdi Bashiri
Roqayeh Alizadeh
author_sort Jafar Bagherinejad
collection DOAJ
description Maximal covering location problem is one of the most important network location problems that is used in various applications. To improve the application of the maximal covering location problem (MCLP), several capacitated MCLP models were proposed. However, most of these models assume only one fixed capacity level for facilities. This assumption may limit the application of the capacitated MCLP. In this paper, a dynamic modular capacitated maximal covering location problem (DMCMCLP) is proposed and formulated that the limited capacities of facilities is designed into two levels of determining allocated modules and their sizes for facilities at each potential site. To evaluate the performance of DMCMCLP, a numerical example has been solved and DMCMCLP is compared with dynamic maximal covering location problem (DMCLP). The results confirm superiority of the proposed model comparing to the DMCLP model. Moreover the sensitivity analysis confirm the performance accuracy of the proposed model.
first_indexed 2024-03-12T11:10:02Z
format Article
id doaj.art-f648899cf0d540799535593abb880f23
institution Directory Open Access Journal
issn 2251-6409
2423-6950
language fas
last_indexed 2024-03-12T11:10:02Z
publishDate 2018-01-01
publisher University of Isfahan
record_format Article
series مدیریت تولید و عملیات
spelling doaj.art-f648899cf0d540799535593abb880f232023-09-02T03:08:25ZfasUniversity of Isfahanمدیریت تولید و عملیات2251-64092423-69502018-01-01829911410.22108/jpom.2017.9242622384Modeling and solving the dynamic modular capacitated maximal covering location problemJafar Bagherinejad0Mehdi Bashiri1Roqayeh Alizadeh2Associate professor Dept. of industrial engineering, Alzahra University, Tehran, IranAssociate professor Dept. of industrial engineering, Shahed University, Tehran, IranMSc student of industrial engineering, Alzahra University, Tehran, IranMaximal covering location problem is one of the most important network location problems that is used in various applications. To improve the application of the maximal covering location problem (MCLP), several capacitated MCLP models were proposed. However, most of these models assume only one fixed capacity level for facilities. This assumption may limit the application of the capacitated MCLP. In this paper, a dynamic modular capacitated maximal covering location problem (DMCMCLP) is proposed and formulated that the limited capacities of facilities is designed into two levels of determining allocated modules and their sizes for facilities at each potential site. To evaluate the performance of DMCMCLP, a numerical example has been solved and DMCMCLP is compared with dynamic maximal covering location problem (DMCLP). The results confirm superiority of the proposed model comparing to the DMCLP model. Moreover the sensitivity analysis confirm the performance accuracy of the proposed model.http://jpom.ui.ac.ir/article_22384_2ce2f21923b6f2e0c269c70df6d34bc5.pdfLocation problemMaximal coveringModularityVariable capacityDynamic
spellingShingle Jafar Bagherinejad
Mehdi Bashiri
Roqayeh Alizadeh
Modeling and solving the dynamic modular capacitated maximal covering location problem
مدیریت تولید و عملیات
Location problem
Maximal covering
Modularity
Variable capacity
Dynamic
title Modeling and solving the dynamic modular capacitated maximal covering location problem
title_full Modeling and solving the dynamic modular capacitated maximal covering location problem
title_fullStr Modeling and solving the dynamic modular capacitated maximal covering location problem
title_full_unstemmed Modeling and solving the dynamic modular capacitated maximal covering location problem
title_short Modeling and solving the dynamic modular capacitated maximal covering location problem
title_sort modeling and solving the dynamic modular capacitated maximal covering location problem
topic Location problem
Maximal covering
Modularity
Variable capacity
Dynamic
url http://jpom.ui.ac.ir/article_22384_2ce2f21923b6f2e0c269c70df6d34bc5.pdf
work_keys_str_mv AT jafarbagherinejad modelingandsolvingthedynamicmodularcapacitatedmaximalcoveringlocationproblem
AT mehdibashiri modelingandsolvingthedynamicmodularcapacitatedmaximalcoveringlocationproblem
AT roqayehalizadeh modelingandsolvingthedynamicmodularcapacitatedmaximalcoveringlocationproblem