Dynamic multi-objective maximal covering location problem with gradual coverage

Abstract

In this study, a dynamic multiple-objective model of maximal covering location problem has been presented in which the gradual coverage radius has been taken into account. The model has several aims, including: maximizing initial coverage, maximizing backup coverage, and minimizing the fixed and variable expenses related to the location, transportation vehicles, and variable demands in the course of programming. This model intends to find the best location for the centers of emergency services which can meet the maximum demands of present and future. In this model, the variables of backup and initial coverage have been presented fractionally in order to cover more demands. Then, an example with random numbers has been given and solved by lexicographic multi-objective linear programming (LMOLP) and fuzzy goal programming (FGP) approaches. The obtained results show the superiority of fuzzy goal programming approaches.