Dynamic Multi-objective Maximal Covering Location Problem with Gradual Coverage
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.
KeywordsMaximal covering location problem (MCLP) Fuzzy goal programming (FGP) Multi-objective models Dynamic location
- Başar A, Çatay B, Ünlüyurt T (2011) A multi-period double coverage approach for locating the emergency medical service stations in Istanbul. J Oper Res Soc 62:627–637Google Scholar
- Berman O, Krass D, Drezner Z (2003) The gradual covering decay location problem on a network. Eur J Oper Res 151:474–480Google Scholar
- Chen LH, Tsai FC (2001) Fuzzy goal programming with different importance and priorities. Eur J Oper Res 133:548–56Google Scholar
- Coskun N, Erol R (2010) An optimization model for locating and sizing emergency medical service stations. J Med Syst 34:43–49Google Scholar
- Fazel Zarandi MH, Davari S, Haddad Sisakht SA (2013) The large-scale dynamic maximal covering location problem. Math Comput Model 57:710–719Google Scholar