کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10346261 | 698778 | 2013 | 11 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A hybrid genetic-variable neighborhood search algorithm for the cell formation problem based on grouping efficacy
ترجمه فارسی عنوان
الگوریتم جستجوی هم محله متغیر ژنتیکی برای مشکل تشکیل سلول بر اساس کارایی گروه بندی
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
مشکل تشکیل سلول، کارآیی گروهی، الگوریتم ژنتیک ترکیبی،
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
چکیده انگلیسی
Cell formation problem attempts to group machines and part families in dedicated manufacturing cells such that the number of voids and exceptional elements in cells are minimized. In this paper, we presented a linear fractional programming model with the objective of maximizing the grouping efficacy while the number of cells is unknown. To show the effectiveness of the proposed model, two test problems were applied. Then, to solve the model for real-sized applications, a hybrid meta-heuristic algorithm in which genetic algorithm and variable neighborhood search are combined. Using the grouping efficacy measure, we have also compared the performance of the proposed algorithm on a set of 35 test problems from the literature. The results show that the proposed GA-VNS method outperforms the state-of-the-art algorithms.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 40, Issue 4, April 2013, Pages 980-990
Journal: Computers & Operations Research - Volume 40, Issue 4, April 2013, Pages 980-990
نویسندگان
Mohammad Mahdi Paydar, Mohammad Saidi-Mehrabad,