AN EFFICIENT HEURISTIC ALGORITHM FOR SOLVING SET-COVERING PROBLEMS

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.; RABABNI M.; ALI HOSSEINI A.R.

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

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN) Year:2003 | Volume:14 | Issue:4 Page(s): 95-106

Download Full-Text

Persian Verion

View:

950

Download:

Cites:

Information Journal Paper

Title

AN EFFICIENT HEURISTIC ALGORITHM FOR SOLVING SET-COVERING PROBLEMS

Author(s)

TAVAKOLI MOGHADAM R. | RABABNI M. | ALI HOSSEINI A.R. | Issue Writer Certificate

Keywords

Not Registered.

Abstract

Set covering problem is covering the rows of a matrix by subset of the columns at minimum cost. Considering the fact that set-covering problem is a NP-complete one, most contemporary researchers have tried recently to focus on applying heuristic algorithms to solve the above problem. The most promising heuristic method is genetic algorithm trying to simulate the natural evolution process. This algorithm is an efficient and suitable approach to handle set covering problems. In this paper, a special design of the proposed genetic algorithm is used to solve such problems. The computational result of great trails confirms the efficiency of genetic algorithms.

Cites

No record.

References

No record.

Cite

APA: Copy

TAVAKOLI MOGHADAM, R., RABABNI, M., & ALI HOSSEINI, A.R.. (2003). AN EFFICIENT HEURISTIC ALGORITHM FOR SOLVING SET-COVERING PROBLEMS. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), 14(4), 95-106. SID. https://sid.ir/paper/65716/en

Vancouver: Copy

TAVAKOLI MOGHADAM R., RABABNI M., ALI HOSSEINI A.R.. AN EFFICIENT HEURISTIC ALGORITHM FOR SOLVING SET-COVERING PROBLEMS. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN)[Internet]. 2003;14(4):95-106. Available from: https://sid.ir/paper/65716/en

IEEE: Copy

R. TAVAKOLI MOGHADAM, M. RABABNI, and A.R. ALI HOSSEINI, “AN EFFICIENT HEURISTIC ALGORITHM FOR SOLVING SET-COVERING PROBLEMS,” INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), vol. 14, no. 4, pp. 95–106, 2003, [Online]. Available: https://sid.ir/paper/65716/en

Related Journal Papers