Artikel

General form of a cooperative gradual maximal covering location problem

zu Verbundenen Objekten

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.

Sprache
Englisch

Erschienen in
Journal: Journal of Industrial Engineering International ; ISSN: 2251-712X ; Volume: 14 ; Year: 2018 ; Issue: 2 ; Pages: 241-253 ; Heidelberg: Springer

Klassifikation
Management
Thema
Location–allocation
Maximal covering
Cooperative covering
Gradual covering
Metaheuristics

Ereignis
Geistige Schöpfung
(wer)
Bagherinejad, Jafar
Bashiri, Mahdi
Nikzad, Hamideh
Ereignis
Veröffentlichung
(wer)
Springer
(wo)
Heidelberg
(wann)
2018

DOI
doi:10.1007/s40092-017-0219-5
Handle
Letzte Aktualisierung
10.03.2025, 11:44 MEZ

Datenpartner

Dieses Objekt wird bereitgestellt von:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Original beim Datenpartner anzeigen

Objekttyp

  • Artikel

Beteiligte

  • Bagherinejad, Jafar
  • Bashiri, Mahdi
  • Nikzad, Hamideh
  • Springer

Entstanden

  • 2018

Ähnliche Objekte (12)

General form of a cooperative gradual maximal covering location problem

General form of a cooperative gradual maximal covering location problem

Gradual Covering Location Problem with Stochastic Radius

Konferenzbeitrag

Gradual Covering Location Problem with Stochastic Radius

The ordered gradual covering location problem on a network

The ordered gradual covering location problem on a network

Using quantum computing to solve the maximal covering location problem

Using quantum computing to solve the maximal covering location problem

An approach for solving maximal covering location problems with fuzzy constraints

An approach for solving maximal covering location problems with fuzzy constraints

Cooperative facility location games

Cooperative facility location games

Normal Covering Spaces with Maximal Bottom of Spectrum

Normal Covering Spaces with Maximal Bottom of Spectrum

Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems

Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems

Gradual.

Abschnitt

Gradual.

Gradual.

Abschnitt

Gradual.

Gradual-Fragment

Handschrift

Gradual-Fragment

Mixed-integer programming approaches for the time-constrained maximal covering routing problem

Mixed-integer programming approaches for the time-constrained maximal covering routing problem

Verbundene Objekte