Hybrid Covering Location Problem: Set Covering and Modular Maximal Covering Location Problem

摘要

To benefit from the location advantages provided from two main covering location problems, namely set covering location problem and maximal covering location problem, a new mathematical model is presented in this study. In this model, the main facilities are located gradually through the planning periods, providing full coverage for the incremental demand of nodes. In addition, a limited number of modules are assigned to the located facilities to maximize the covered demand nodes in operational periods. Combining the set covering and maximal covering location problems in one model, to take advantage of the merits of both models is studied. Some test problems are solved to investigate the proposed model. The numerical results confirm the applicability of the model and provide insights for the proposed model.