کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6896156 | 1445991 | 2016 | 25 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem](/preview/png/6896156.png)
چکیده انگلیسی
In this paper, a hybrid algorithm based on variable neighborhood search and ant colony optimization is proposed to solve the single row facility layout problem. In the proposed algorithm, three neighborhood structures are utilized to enhance the exploitation ability. Meanwhile, new gain techniques are developed to reduce the mathematical calculations of the objective function values. Furthermore, ant colony optimization as the shaking step is used to avoid being stuck at the local optima. In addition, a novel pheromone updating rule has been proposed based on both the best and worst solutions of the ants. A reverse criterion based on edit distance measure is applied to help ants to converge to the best solution and reduce the solution space. Finally, numerical simulation is carried out based on the benchmark instances, and the comparisons with some existing algorithms demonstrate the effectiveness of the proposed algorithm.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 248, Issue 3, 1 February 2016, Pages 899-909
Journal: European Journal of Operational Research - Volume 248, Issue 3, 1 February 2016, Pages 899-909
نویسندگان
Jian Guan, Geng Lin,