SOLVING THE SET COVERING PROBLEM BY USING SIMULATED ANNEALING (SA)

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.

TAVAKOLI MOGHADAM R.; RABANI M.; SAFAEI N.

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

Journal Paper

Paper Information

Journal: AMIRKABIR Year:2004 | Volume:15 | Issue:59-D Page(s): 10-18

Download Full-Text

Persian Verion

View:

2,514

Download:

Cites:

Information Journal Paper

Title

SOLVING THE SET COVERING PROBLEM BY USING SIMULATED ANNEALING (SA)

Author(s)

TAVAKOLI MOGHADAM R. | RABANI M. | SAFAEI N. | Issue Writer Certificate

Keywords

SIMULATED ANNEALING (SA) SET COVERING PROBLEMQ4

COMBINATORIAL OPTIMIZATIONQ4

Abstract

The set covering problem (SCP) is one of the location -allocation models. It s objective is to minimize the cost of facilities location-allocation in an optimal structure in such a way that each customer or zone has been covered by at least one facility. The above problem is a class of NP-Hard problems that cannot be solved by exact algorithms in a reasonable amount of computational time. Thus in this paper, a simulated annealing (SA) algorithm is proposed to solve the SCP. This algorithm is one of the efficient metaheuristics based on a neighbourhood search within solution space, acceptance of probability, and inferior solutions to scape from trap (i.e., local optimal solution). Ten test problems are solved in which associated results show the efficiency and validity: of the SA algorithm for solving the SCP. The validity comparisions of the results obtained the proposed algorithm are compared with the results reported by three methods named as Lingo 8 Software, Heragu's heuristic, and Genetic Algorithms (GAs).

Cites

No record.

References

No record.

Cite

APA: Copy

TAVAKOLI MOGHADAM, R., RABANI, M., & SAFAEI, N.. (2004). SOLVING THE SET COVERING PROBLEM BY USING SIMULATED ANNEALING (SA) . AMIRKABIR, 15(59-D), 10-18. SID. https://sid.ir/paper/703/en

Vancouver: Copy

TAVAKOLI MOGHADAM R., RABANI M., SAFAEI N.. SOLVING THE SET COVERING PROBLEM BY USING SIMULATED ANNEALING (SA) . AMIRKABIR[Internet]. 2004;15(59-D):10-18. Available from: https://sid.ir/paper/703/en

IEEE: Copy

R. TAVAKOLI MOGHADAM, M. RABANI, and N. SAFAEI, “SOLVING THE SET COVERING PROBLEM BY USING SIMULATED ANNEALING (SA) ,” AMIRKABIR, vol. 15, no. 59-D, pp. 10–18, 2004, [Online]. Available: https://sid.ir/paper/703/en

Related Journal Papers