A NEW HEURISTIC SOLUTION METHOD FOR MAXIMAL COVERING LOCATION-ALLOCATION PROBLEM WITH M/M/1 QUEUEING SYSTEM

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.

MOEEN MOGHADAS F.; TAGHIZADEH KAKHKI H.

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

Journal Paper

Paper Information

Journal: Journal of Sciences, Islamic Republic of Iran Year:2012 | Volume:23 | Issue:1 Page(s): 67-75

Download Full-Text

Persian Verion

View:

947

Download:

195

Cites:

Information Journal Paper

Title

A NEW HEURISTIC SOLUTION METHOD FOR MAXIMAL COVERING LOCATION-ALLOCATION PROBLEM WITH M/M/1 QUEUEING SYSTEM

Author(s)

MOEEN MOGHADAS F. | TAGHIZADEH KAKHKI H. | Issue Writer Certificate

Keywords

MAXIMAL COVERING LOCATION PROBLEMSQ2

M/M/1 QUEUEING SYSTEMQ2

HEURISTICSQ2

GRASPQ2

Abstract

We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/M/1 QUEUEING SYSTEM. We propose a new solution procedure based on decomposition of the problem into smaller sub-problems. We solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic GRASP. We also solve the entire model with GRASP. Computational results for these approaches are compared with the solutions obtained by CPLEX. Results show that using the new procedure in which sub-problems were solved with Branch and bound is better.

Cites

No record.

References

No record.

Cite

APA: Copy

MOEEN MOGHADAS, F., & TAGHIZADEH KAKHKI, H.. (2012). A NEW HEURISTIC SOLUTION METHOD FOR MAXIMAL COVERING LOCATION-ALLOCATION PROBLEM WITH M/M/1 QUEUEING SYSTEM. JOURNAL OF SCIENCES ISLAMIC REPUBLIC OF IRAN, 23(1), 67-75. SID. https://sid.ir/paper/84128/en

Vancouver: Copy

MOEEN MOGHADAS F., TAGHIZADEH KAKHKI H.. A NEW HEURISTIC SOLUTION METHOD FOR MAXIMAL COVERING LOCATION-ALLOCATION PROBLEM WITH M/M/1 QUEUEING SYSTEM. JOURNAL OF SCIENCES ISLAMIC REPUBLIC OF IRAN[Internet]. 2012;23(1):67-75. Available from: https://sid.ir/paper/84128/en

IEEE: Copy

F. MOEEN MOGHADAS, and H. TAGHIZADEH KAKHKI, “A NEW HEURISTIC SOLUTION METHOD FOR MAXIMAL COVERING LOCATION-ALLOCATION PROBLEM WITH M/M/1 QUEUEING SYSTEM,” JOURNAL OF SCIENCES ISLAMIC REPUBLIC OF IRAN, vol. 23, no. 1, pp. 67–75, 2012, [Online]. Available: https://sid.ir/paper/84128/en

Related Journal Papers