کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5471006 | 1519386 | 2017 | 27 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Matheuristic for the decentralized factories scheduling problem
ترجمه فارسی عنوان
ماتریالیسم برای کارخانه های غیر متمرکز برنامه ریزی مشکل
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
الگوریتم الکترومغناطیس مانند، مدل سازی ریاضی، ماتریالیسم، شبکه تولید چند کارخانه، متغیر جستجوی محله،
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مکانیک محاسباتی
چکیده انگلیسی
In this study, a novel mixed integer linear programming (MILP) model is developed for the decentralized factories scheduling problem, where a set of transporters is used for shipping goods among parallel factories to minimize the production costs over all of the factories. Due to its typical features, such as multiple heterogeneous factories and transportation times, this problem is extremely difficult to solve, especially for large-scale problems. In order to address this difficulty, the main aim of this study is to develop a new solution algorithm based on the interoperation of metaheuristics and mathematical programming techniques to minimize the production costs for jobs. The algorithm comprises an electromagnetism-like algorithm and variable neighborhood search. In this hybridization based on MILP relaxation, the guiding principle involves the ordering of neighborhood structures. The results obtained by the proposed algorithm and MILP are analyzed and compared for various test problems.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematical Modelling - Volume 47, July 2017, Pages 668-684
Journal: Applied Mathematical Modelling - Volume 47, July 2017, Pages 668-684
نویسندگان
J. Behnamian,