MODELING AND SOLVING THE DYNAMIC MODULAR CAPACITATED MAXIMAL COVERING LOCATION PROBLEM

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; ALIZADEH ROQAYEH

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

Journal Paper

Paper Information

Journal: PRODUCTION AND OPERATIONS MANAGEMENT Year:2018 | Volume:8 | Issue:2 (15) Page(s): 99-114

Download Full-Text

Persian Verion

View:

1,181

Download:

Cites:

Information Journal Paper

Title

MODELING AND SOLVING THE DYNAMIC MODULAR CAPACITATED MAXIMAL COVERING LOCATION PROBLEM

Author(s)

BAGHERINEJAD JAFAR | BASHIRI MAHDI | ALIZADEH ROQAYEH | Issue Writer Certificate

Keywords

LOCATION PROBLEMQ2

MAXIMAL COVERINGQ1

MODULARITYQ1

VARIABLE CAPACITYQ1

DYNAMICQ1

Abstract

Maximal covering LOCATION PROBLEM is one of the most important network LOCATION PROBLEMs that is used in various applications. To improve the application of the MAXIMAL COVERING LOCATION PROBLEM (MCLP), several capacitated MCLP models were proposed. However, most of these models assume only one fixed capacity level for facilities. This assumption may limit the application of the capacitated MCLP. In this paper, a DYNAMIC modular capacitated MAXIMAL COVERING LOCATION PROBLEM (DMCMCLP) is proposed and formulated that the limited capacities of facilities is designed into two levels of determining allocated modules and their sizes for facilities at each potential site. To evaluate the performance of DMCMCLP, a numerical example has been solved and DMCMCLP is compared with DYNAMIC MAXIMAL COVERING LOCATION PROBLEM (DMCLP). The results confirm superiority of the proposed model comparing to the DMCLP model. Moreover the sensitivity analysis confirm the performance accuracy of the proposed model.

Cites

No record.

References

No record.

Cite

APA: Copy

BAGHERINEJAD, JAFAR, BASHIRI, MAHDI, & ALIZADEH, ROQAYEH. (2018). MODELING AND SOLVING THE DYNAMIC MODULAR CAPACITATED MAXIMAL COVERING LOCATION PROBLEM. PRODUCTION AND OPERATIONS MANAGEMENT, 8(2 (15) ), 99-114. SID. https://sid.ir/paper/217487/en

Vancouver: Copy

BAGHERINEJAD JAFAR, BASHIRI MAHDI, ALIZADEH ROQAYEH. MODELING AND SOLVING THE DYNAMIC MODULAR CAPACITATED MAXIMAL COVERING LOCATION PROBLEM. PRODUCTION AND OPERATIONS MANAGEMENT[Internet]. 2018;8(2 (15) ):99-114. Available from: https://sid.ir/paper/217487/en

IEEE: Copy

JAFAR BAGHERINEJAD, MAHDI BASHIRI, and ROQAYEH ALIZADEH, “MODELING AND SOLVING THE DYNAMIC MODULAR CAPACITATED MAXIMAL COVERING LOCATION PROBLEM,” PRODUCTION AND OPERATIONS MANAGEMENT, vol. 8, no. 2 (15) , pp. 99–114, 2018, [Online]. Available: https://sid.ir/paper/217487/en

Related Journal Papers