:: دوره 1، شماره 3 - ( 9-1390 ) ::
جلد 1 شماره 3 صفحات 11-1 برگشت به فهرست نسخه ها
Applying Genetic Algorithm to Dynamic Layout Problem
چکیده:   (10584 مشاهده)
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.
متن کامل [PDF 166 kb]   (4821 دریافت)    
نوع مطالعه: پژوهشي | موضوع مقاله: عمومى
دریافت: 1390/9/15 | انتشار: 1390/9/24


XML   English Abstract   Print



بازنشر اطلاعات
Creative Commons License این مقاله تحت شرایط Creative Commons Attribution-NonCommercial 4.0 International License قابل بازنشر است.
دوره 1، شماره 3 - ( 9-1390 ) برگشت به فهرست نسخه ها