کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6866117 | 679096 | 2015 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Variable exponential neighborhood search for the long chain design problem
ترجمه فارسی عنوان
متغیر محله نمایش محله برای مشکل زنجیره طولانی
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
طراحی زنجیره طولانی، 2-نزدیک شدن، متغیر جستجوی محله،
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
چکیده انگلیسی
Although the long chain flexibility strategy is an effective way to match supplies with uncertain demands, few studies on how to implement an optimal strategy with minimum link costs have been conducted. In this paper, the optimal long chain design problem is formulated as a mixed 0-1 linear programming. Since it is proved to be NP-complete, an approximation algorithm is proposed to obtain a suboptimal solution, which is a 2-approximation algorithm under a quadrangle inequality condition. To further improve this solution, a variable exponential neighborhood search method is proposed. In this method, based on an equivalent quadratic reformulation, new neighborhoods are introduced, which contain exponential sizes of feasible solutions and also can be optimized efficiently. Experiments show that for most instances the proposed algorithms are superior to the CPLEX solver and other construction & improvement algorithms in both solution preciseness and computation time.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Neurocomputing - Volume 148, 19 January 2015, Pages 269-277
Journal: Neurocomputing - Volume 148, 19 January 2015, Pages 269-277
نویسندگان
Yuli Zhang, Shiji Song, Cheng Wu, Wenjun Yin,