APPLYING GENETIC ALGORITHM TO DYNAMIC LAYOUT PROBLEM

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.

CHANDRATRE K.V.; NANDURKAR K.N.

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

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF APPLIED OPERATIONAL RESEARCH Year:2012 | Volume:1 | Issue:3 Page(s): 1-9

Download Full-Text

View:

288

Download:

180

Cites:

Information Journal Paper

Title

APPLYING GENETIC ALGORITHM TO DYNAMIC LAYOUT PROBLEM

Author(s)

CHANDRATRE K.V. | NANDURKAR K.N. | Issue Writer Certificate

Keywords

DYNAMIC LAYOUT

HEURISTICS

GENETIC ALGORITHM

Abstract

In today's economy, manufacturing plants must be able to operate efficiently and respond quickly to changes in the product mix and demand. [1] Layout design has a significant impact on manufacturing efficiency. Initially, it was treated as a static decision but due to improvements in technology, it is possible to rearrange the manufacturing facilities in different scenarios. The Plant layout affects on the total cost in the industry. Nowadays DYNAMIC LAYOUT is becoming an important issue. DYNAMIC LAYOUT is the different layout at different time periods to satisfy the needs of industry, due to change in product, or reduced product life cycle, or change in demand. Layout problem is a quadratic assignment problem, and for larger size problems it becomes impossible to be solved. So, for solving this problem Meta heuristic algorithms are used. In this paper, DYNAMIC LAYOUT problem is solved using GENETIC ALGORITHM. This Dynamic Problem is restricted up to two-time periods only.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

CHANDRATRE, K.V., & NANDURKAR, K.N.. (2012). APPLYING GENETIC ALGORITHM TO DYNAMIC LAYOUT PROBLEM. INTERNATIONAL JOURNAL OF APPLIED OPERATIONAL RESEARCH, 1(3), 1-9. SID. https://sid.ir/paper/642392/en

Vancouver: Copy

CHANDRATRE K.V., NANDURKAR K.N.. APPLYING GENETIC ALGORITHM TO DYNAMIC LAYOUT PROBLEM. INTERNATIONAL JOURNAL OF APPLIED OPERATIONAL RESEARCH[Internet]. 2012;1(3):1-9. Available from: https://sid.ir/paper/642392/en

IEEE: Copy

K.V. CHANDRATRE, and K.N. NANDURKAR, “APPLYING GENETIC ALGORITHM TO DYNAMIC LAYOUT PROBLEM,” INTERNATIONAL JOURNAL OF APPLIED OPERATIONAL RESEARCH, vol. 1, no. 3, pp. 1–9, 2012, [Online]. Available: https://sid.ir/paper/642392/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops