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 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.