کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4635909 | 1340716 | 2006 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Optimization of the quadratic assignment problem using an ant colony algorithm
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Optimization of the quadratic assignment problem using an ant colony algorithm Optimization of the quadratic assignment problem using an ant colony algorithm](/preview/png/4635909.png)
چکیده انگلیسی
Ant algorithm is a multi-agent systems inspired by the behaviors of real ant colonies function to solve optimization problems. In this paper an ant colony optimization algorithm is developed to solve the quadratic assignment problem. The local search process of the algorithm is simulated annealing. In the exploration of the search space, the evaluation of pheromones which are laid on the ground by ants is used. In this work, the algorithm is analyzed by using current problems in the literature and is compared with other metaheuristics.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 183, Issue 1, 1 December 2006, Pages 427–435
Journal: Applied Mathematics and Computation - Volume 183, Issue 1, 1 December 2006, Pages 427–435
نویسندگان
Nihan Çetin Demirel, M. Duran Toksarı,