General form of a cooperative gradual maximal covering location problem

Jafar Bagherinejad, Mahdi Bashiri, Hamideh Nikzad

Research output: Contribution to journalArticle

9 Citations (Scopus)
1 Downloads (Pure)

Abstract

Cooperative and gradual covering are two new methods for developing covering location models. In this paper, a cooperative maximal covering location–allocation model is developed (CMCLAP). In addition, both cooperative and gradual covering concepts are applied to the maximal covering location simultaneously (CGMCLP). Then, we develop an integrated form of a cooperative gradual maximal covering location problem, which is called a general CGMCLP. By setting the model parameters, the proposed general model can easily be transformed into other existing models, facilitating general comparisons. The proposed models are developed without allocation for physical signals and with allocation for non-physical signals in discrete location space. Comparison of the previously introduced gradual maximal covering location problem (GMCLP) and cooperative maximal covering location problem (CMCLP) models with our proposed CGMCLP model in similar data sets shows that the proposed model can cover more demands and acts more efficiently. Sensitivity analyses are performed to show the effect of related parameters and the model’s validity. Simulated annealing (SA) and a tabu search (TS) are proposed as solution algorithms for the developed models for large-sized instances. The results show that the proposed algorithms are efficient solution approaches, considering solution quality and running time.

Original languageEnglish
Pages (from-to)241-253
Number of pages13
JournalJournal of Industrial Engineering International
Volume14
Issue number2
DOIs
Publication statusPublished - 18 Jul 2017
Externally publishedYes

Bibliographical note

Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Keywords

  • Cooperative covering
  • Gradual covering
  • Location–allocation
  • Maximal covering
  • Metaheuristics

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Fingerprint Dive into the research topics of 'General form of a cooperative gradual maximal covering location problem'. Together they form a unique fingerprint.

  • Cite this