AN EFFICIENT HYBRID HEURISTIC ALGORITHM FOR DYNAMIC FACILITY LAYOUT PROBLEMS WITH BUDGET CONSTRAINTS

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.

FARAJI H.; NADERI B.

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

Journal Paper

Paper Information

Journal: Journal of Operational Research in its Applications Year:2016 | Volume:12 | Issue:4 (47) Page(s): 99-115

Download Full-Text

Persian Verion

View:

1,235

Download:

Cites:

Information Journal Paper

Title

AN EFFICIENT HYBRID HEURISTIC ALGORITHM FOR DYNAMIC FACILITY LAYOUT PROBLEMS WITH BUDGET CONSTRAINTS

Author(s)

FARAJI H. | NADERI B. | Issue Writer Certificate

Keywords

DYNAMIC FACILITY LAYOUT PROBLEM

LIMITED BUDGET

GENETIC ALGORITHM

SIMULATED ANNEALING ALGORITHM

Abstract

The objective of the DYNAMIC FACILITY LAYOUT PROBLEM (DFLP) is to find the best layout for the company facilities in a certain planning horizon by considering the machine rearrangement costs. It should be noticed that most previous researches did not consider the company budget for rearranging the machines or departments. Because these rearrangements are costly activities, therefore it is normal for a company to have a LIMITED BUDGET in this regard. Due to the complex structure of the problem, there are a few researches in the literature while all of them have been focused to find a near optimum solution. In this paper, a new heuristic approach has been developed by combining GENETIC ALGORITHM and SIMULATED ANNEALING ALGORITHM which is the main contribution of the paper. The results of applying the proposed algorithm were tested over a wide range of test problems taken from the literature. As the results show, the proposed algorithm has good solutions quality so that it can dominate the previous researches.

Cites

No record.

References

A WEIGHTED NONLINEAR OPTIMIZATION MODEL FOR FACILITY LAYOUT DESIGN

Cite

APA: Copy

FARAJI, H., & NADERI, B.. (2016). AN EFFICIENT HYBRID HEURISTIC ALGORITHM FOR DYNAMIC FACILITY LAYOUT PROBLEMS WITH BUDGET CONSTRAINTS. JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS), 12(4 (47)), 99-115. SID. https://sid.ir/paper/164447/en

Vancouver: Copy

FARAJI H., NADERI B.. AN EFFICIENT HYBRID HEURISTIC ALGORITHM FOR DYNAMIC FACILITY LAYOUT PROBLEMS WITH BUDGET CONSTRAINTS. JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS)[Internet]. 2016;12(4 (47)):99-115. Available from: https://sid.ir/paper/164447/en

IEEE: Copy

H. FARAJI, and B. NADERI, “AN EFFICIENT HYBRID HEURISTIC ALGORITHM FOR DYNAMIC FACILITY LAYOUT PROBLEMS WITH BUDGET CONSTRAINTS,” JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS), vol. 12, no. 4 (47), pp. 99–115, 2016, [Online]. Available: https://sid.ir/paper/164447/en

Related Journal Papers