کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
10127880 1645105 2018 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Memetic social spider optimization algorithm for scheduling two-stage assembly flowshop in a distributed environment
ترجمه فارسی عنوان
الگوریتم بهینه سازی عنکبوت اجتماعی برای برنامه ریزی جریان دو بعدی مرحله مونتاژ در یک محیط توزیع شده
موضوعات مرتبط
مهندسی و علوم پایه سایر رشته های مهندسی مهندسی صنعتی و تولید
چکیده انگلیسی
This paper studies the distributed two-stage assembly flowshop problem with separate setup times, which is a generalisation for the regular two-stage assembly flowshop problem in the distributed manufacturing environment. The optimization objective is to find a suitable job schedule such that the criterion of total completion time is minimized. To deal with such a problem, we propose a novel memetic algorithm (MA) based on a recently developed social spider optimization (SSO). To the best of our knowledge, it is the first effort to explore the SSO-based MA (MSSO) and to apply SSO in the field of combinational optimization. In the proposed MSSO algorithm, we first modify the original version of SSO to adapt to the distributed problems, and then integrate two improvement techniques, problem-special local search and self-adaptive restart strategy, within MA framework. In the numerical experiment, the parameters used in MSSO are calibrated and suitable parameter values are suggested based on the Taguchi method. Experimental results and comparisons with the existing algorithms validate the effectiveness and efficiency of the proposed MSSO for addressing the considered problem. In addition, the effect of problem scale parameters on MSSO and the effectiveness of the proposed improvement techniques are also investigated and demonstrated.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Industrial Engineering - Volume 125, November 2018, Pages 423-433
نویسندگان
, ,