A NEW HEURISTIC ALGORITHM FOR TOTAL 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.

RAJABPOUR SANATI S.; NAIMI SADIGH A.

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

Journal Paper

Paper Information

Journal: Journal of Operational Research in its Applications Year:2017 | Volume:14 | Issue:3 (54) Page(s): 69-88

Download Full-Text

Persian Verion

View:

1,073

Download:

Cites:

Information Journal Paper

Title

A NEW HEURISTIC ALGORITHM FOR TOTAL COVERING LOCATION PROBLEM

Author(s)

RAJABPOUR SANATI S. | NAIMI SADIGH A. | Issue Writer Certificate

Keywords

COVERING PROBLEMQ1

HEURISTIC ALGORITHMQ1

SIMULATED ANNEALING ALGORITHMQ2

TAGUCHI METHODQ1

Abstract

Set COVERING PROBLEM has many applications such as emergency systems, retailers’ facilities, hospitals, radar devices, and military logistics, and it is considered as an Np-Hard problems. The goal of set COVERING PROBLEM is to find a subset such that the union of the subset members cover the whole set. In this paper, we present a new HEURISTIC ALGORITHM to solve the set COVERING PROBLEM. In the HEURISTIC ALGORITHM, the amounts of improvement are calculated for any of the vertices in the graph. Based on the improvement, we consider vertices in the subset. The amounts of improvement are updated in each iteration to find near optimal solution. A SIMULATED ANNEALING ALGORITHM, whose parameters are tuned by TAGUCHI METHOD, is presented to compare with our proposed HEURISTIC ALGORITHM. The computational results show that the HEURISTIC ALGORITHM works better than the SIMULATED ANNEALING ALGORITHM in both quality of solution and time view.

Cites

No record.

References

No record.

Cite

APA: Copy

RAJABPOUR SANATI, S., & NAIMI SADIGH, A.. (2017). A NEW HEURISTIC ALGORITHM FOR TOTAL COVERING LOCATION PROBLEM. JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS), 14(3 (54) ), 69-88. SID. https://sid.ir/paper/164640/en

Vancouver: Copy

RAJABPOUR SANATI S., NAIMI SADIGH A.. A NEW HEURISTIC ALGORITHM FOR TOTAL COVERING LOCATION PROBLEM. JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS)[Internet]. 2017;14(3 (54) ):69-88. Available from: https://sid.ir/paper/164640/en

IEEE: Copy

S. RAJABPOUR SANATI, and A. NAIMI SADIGH, “A NEW HEURISTIC ALGORITHM FOR TOTAL COVERING LOCATION PROBLEM,” JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS), vol. 14, no. 3 (54) , pp. 69–88, 2017, [Online]. Available: https://sid.ir/paper/164640/en

Related Journal Papers