Volume 14, Issue 3 (10-2017)                   jor 2017, 14(3): 69-88 | Back to browse issues page

XML Persian Abstract Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Rajabpour sanati S, Naimi Sadigh A. A new heuristic algorithm for total covering location problem . jor. 2017; 14 (3) :69-88
URL: http://jamlu.liau.ac.ir/article-1-1234-en.html
Iranian Research Institute for Information Science and Technology (IRANDOC)
Abstract:   (3308 Views)

Set covering problem has many applications such as emergency systems, retailers’ facilities, hospitals, radar devices, and military logistics, and it is considered as Np-Hard problems. The goal of set covering problem is to find a subset such that :::::::::union::::::::: of the subset members covered 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 vertices in the graph. Based on the improvement we consider vertices in the subset. The amounts of improvement updated in each iteration to find near optimal solution. A simulated annealing algorithm, which its parameters tuned with Taguchi method, is presented to compare with our suggested 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.

Full-Text [PDF 1053 kb]   (3478 Downloads)    
Type of Study: Research | Subject: Special
Received: 2017/04/12 | Accepted: 2017/09/5 | Published: 2017/10/21

Add your comments about this article : Your username or Email:

Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.