DESIGNING A DEVELOPED MODEL FOR SET COVERING PROBLEMS BY GENETIC ALGORITHMS

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.

ZEGORDI S.H.A.D.; SEPEHRI M.M.; TAVAKOLI MOGHADAM R.; SAMEE A.

مرکز اطلاعات علمی 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:2006 | Volume:16 | Issue:4 Page(s): 115-124

Download Full-Text

Persian Verion

View:

1,787

Download:

Cites:

Information Journal Paper

Title

DESIGNING A DEVELOPED MODEL FOR SET COVERING PROBLEMS BY GENETIC ALGORITHMS

Author(s)

ZEGORDI S.H.A.D. | SEPEHRI M.M. | TAVAKOLI MOGHADAM R. | SAMEE A. | Issue Writer Certificate

Keywords

Not Registered.

Abstract

In this paper, a mathematical programming model for set covering problems (SCPs) is presented and developed which is close to real-world cases. In this proposed model, m customers are covered by n facilities in such a way that the distance between facilities must not be less than the available defined limit Due to nonlinearity of the model, the traditional optimization methods cannot solve large-sized problems in a reasonable amount of computational time. Thus in this paper, a genetic algorithm is proposed as a well-known metaheuristic method to solve such a hard problem. To show the efficiency the proposed algorithm, 36 test problems classified into 9 groups are generated at random and then they are solved by genetic algorithms. The associated results are compared with the Lingo 6 software package. These results show the efficiency and validation of the proposed algorithm.

Cites

No record.

References

No record.

Cite

APA: Copy

ZEGORDI, S.H.A.D., SEPEHRI, M.M., TAVAKOLI MOGHADAM, R., & SAMEE, A.. (2006). DESIGNING A DEVELOPED MODEL FOR SET COVERING PROBLEMS BY GENETIC ALGORITHMS. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), 16(4), 115-124. SID. https://sid.ir/paper/65894/en

Vancouver: Copy

ZEGORDI S.H.A.D., SEPEHRI M.M., TAVAKOLI MOGHADAM R., SAMEE A.. DESIGNING A DEVELOPED MODEL FOR SET COVERING PROBLEMS BY GENETIC ALGORITHMS. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN)[Internet]. 2006;16(4):115-124. Available from: https://sid.ir/paper/65894/en

IEEE: Copy

S.H.A.D. ZEGORDI, M.M. SEPEHRI, R. TAVAKOLI MOGHADAM, and A. SAMEE, “DESIGNING A DEVELOPED MODEL FOR SET COVERING PROBLEMS BY GENETIC ALGORITHMS,” INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), vol. 16, no. 4, pp. 115–124, 2006, [Online]. Available: https://sid.ir/paper/65894/en

Related Journal Papers