GENERAL FORM OF A COOPERATIVE GRADUAL MAXIMAL COVERING LOCATIONPROBLEM

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

BAGHERINEJAD JAFAR; BASHIRI MAHDI; Nikzad Hamideh

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL Year:2018 | Volume:14 | Issue:2 Page(s): 241-253

Download Full-Text

View:

198

Download:

Cites:

Information Journal Paper

Title

GENERAL FORM OF A COOPERATIVE GRADUAL MAXIMAL COVERING LOCATIONPROBLEM

Author(s)

BAGHERINEJAD JAFAR | BASHIRI MAHDI | Nikzad Hamideh | Issue Writer Certificate

Keywords

LOCATION–

ALLOCATION

MAXIMAL COVERING

COOPERATIVE COVERING

GRADUAL COVERING

METAHEURISTICS

Abstract

Cooperative and gradual covering are two newmethods for developing covering location models. In thispaper, a cooperative maximal covering LOCATION–; allocationmodel is developed (CMCLAP). In addition, both cooperativeand gradual covering concepts are applied to themaximal covering location simultaneously (CGMCLP). Then, we develop an integrated form of a cooperativegradual maximal covering location problem, which iscalled a general CGMCLP. By setting the model parameters, the proposed general model can easily be transformedinto other existing models, facilitating general comparisons. The proposed models are developed without allocationfor physical signals and with allocation for nonphysicalsignals in discrete location space. Comparison ofthe previously introduced gradual maximal covering locationproblem (GMCLP) and cooperative maximal coveringlocation problem (CMCLP) models with our proposedCGMCLP model in similar data sets shows that the proposedmodel can cover more demands and acts more efficiently. Sensitivity analyses are performed to show theeffect of related parameters and the model’ s validity. Simulated annealing (SA) and a tabu search (TS) are proposedas solution algorithms for the developed models forlarge-sized instances. The results show that the proposedalgorithms are efficient solution approaches, consideringsolution quality and running time.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

BAGHERINEJAD, JAFAR, BASHIRI, MAHDI, & Nikzad, Hamideh. (2018). GENERAL FORM OF A COOPERATIVE GRADUAL MAXIMAL COVERING LOCATIONPROBLEM. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, 14(2), 241-253. SID. https://sid.ir/paper/310141/en

Vancouver: Copy

BAGHERINEJAD JAFAR, BASHIRI MAHDI, Nikzad Hamideh. GENERAL FORM OF A COOPERATIVE GRADUAL MAXIMAL COVERING LOCATIONPROBLEM. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL[Internet]. 2018;14(2):241-253. Available from: https://sid.ir/paper/310141/en

IEEE: Copy

JAFAR BAGHERINEJAD, MAHDI BASHIRI, and Hamideh Nikzad, “GENERAL FORM OF A COOPERATIVE GRADUAL MAXIMAL COVERING LOCATIONPROBLEM,” JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, vol. 14, no. 2, pp. 241–253, 2018, [Online]. Available: https://sid.ir/paper/310141/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops