:: Volume 1, Issue 3 (12-2011) ::
2011, 1(3): 1-11 Back to browse issues page
Applying Genetic Algorithm to Dynamic Layout Problem
K. V. Chandratre , K. N. Nandurkar
Abstract:   (10599 Views)
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. Keywords: Dynamic Layout, Heuristics, Genetic Algorithm.
Full-Text [PDF 166 kb]   (4856 Downloads)    
Type of Study: Research | Subject: General
Received: 2011/12/6 | Published: 2011/12/15


XML     Print



Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Volume 1, Issue 3 (12-2011) Back to browse issues page