A genetic algorithm for solving integrated cell formation and layout problem considering alternative routings and machine capacities
Author(s):
Abstract:
In this paper an integrated approach was presented to simultaneously solve the cell formation and its layout problems. Many real world parameters such as part demands, alternative processing routings, machine capacities, cell dimensions, multi-rows arrangement of machines within the cells, aisle distances, etc., were considered in this approach, to make the problem more realistic. Also, in order to measure the material handling cost more precisely, the actual position of machines within the cells was used (instead of the center-to-center distances between the cells). Due to the complexity of the proposed problem a genetic algorithm was developed to efficiently solve it in a reasonable computational time. Finally, the performance of the genetic algorithm was evaluated by solving several numerical examples from the literature. The results revealed that when the decisions about the cell formation, inter and intra-cell layouts and routing of parts are simultaneously made the total material handling cost may reduce significantly in comparison with the sequential design approach.
Keywords:
Language:
English
Published:
Scientia Iranica, Volume:21 Issue: 6, 2014
Pages:
2326 to 2346
magiran.com/p1355535
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 1,390,000ريال میتوانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
- حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران میشود.
- پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانههای چاپی و دیجیتال را به کاربر نمیدهد.
In order to view content subscription is required
Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!