دانلود مقاله ISI انگلیسی شماره 105594
ترجمه فارسی عنوان مقاله

الگوریتم ترکیبی خود سازگار برای حل مشکل انعطاف پذیری کارخانه با زمان تعیین وابسته به توالی

عنوان انگلیسی
A self-adaptive hybrid algorithm for solving flexible job-shop problem with sequence dependent setup time
کد مقاله سال انتشار تعداد صفحات مقاله انگلیسی
105594 2017 10 صفحه PDF
منبع

Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)

Journal : Procedia Computer Science, Volume 112, 2017, Pages 457-466

ترجمه کلمات کلیدی
مشکل شغلی انعطاف پذیر، دوره های تنظیم وابسته به دنباله، الگوریتم های ترکیبی، الگوریتم های خود سازگار،
کلمات کلیدی انگلیسی
Flexible job-shop problem; sequence dependent setup times; Hybrid algorithms; Self-adaptive algorithms;
پیش نمایش مقاله
پیش نمایش مقاله  الگوریتم ترکیبی خود سازگار برای حل مشکل انعطاف پذیری کارخانه با زمان تعیین وابسته به توالی

چکیده انگلیسی

The flexible job shop problem (FJSP) has an important significance in both fields of production management and combinatorial optimization. This problem covers two main difficulties, namely, machine assignment problem and operation sequencing problem. To reflect as close as possible the reality of this problem, the sequence dependent setup time is taken into consideration. For solving such a complex problem, we propose a hybrid algorithm based on a genetic algorithm (GA) combined with iterated local search (ILS). It is well known that the performance of an algorithm is heavily dependent on the setting of control parameters. For that, our algorithm uses a self-adaptive strategy based on : (1) the current specificity of the search space, (2) the preceding results of already applied algorithms (GA and ILS) and (3) their associated parameter settings. We adopt this strategy in order to detect the next promising search direction and maintain the balance between exploration and exploitation. Computational results show that our algorithm provides better solutions than other well known algorithms.