Applying Genetic Algorithm to Dynamic Layout Problem
نویسندگان
چکیده مقاله:
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.
Download for Free
Sign up for free to access the full text
Sign up - It's Free!اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودمنابع مشابه
منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 1 شماره None
صفحات 1- 11
تاریخ انتشار 2011-12
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
کلمات کلیدی برای این مقاله ارائه نشده است
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023