کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
414654 | 680997 | 2008 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Iterated fast local search algorithm for solving quadratic assignment problems
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
This paper concentrates on multi-row machine layout problems that can be accurately formulated as quadratic assignment problems (QAPs). A genetic algorithm-based local search approach is proposed for solving QAPs. In the proposed algorithm, three different mutation operators namely adjacent, pair-wise and insertion or sliding operators are separately combined with a local search method to form a mutation cycle. Effectiveness of introducing the mutation cycle in place of mutation is studied. Performance of the proposed iterated approach is analyzed and the solution qualities obtained are reported.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Robotics and Computer-Integrated Manufacturing - Volume 24, Issue 3, June 2008, Pages 392–401
Journal: Robotics and Computer-Integrated Manufacturing - Volume 24, Issue 3, June 2008, Pages 392–401
نویسندگان
A.S. Ramkumar, S.G. Ponnambalam, N. Jawahar, R.K. Suresh,