کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1141579 | 957029 | 2009 | 4 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Quasiabelian landscapes of the traveling salesman problem are elementary
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
کنترل و بهینه سازی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Quasiabelian landscapes of the traveling salesman problem are elementary Quasiabelian landscapes of the traveling salesman problem are elementary](/preview/png/1141579.png)
چکیده انگلیسی
Regarding a permutation as a (multi-traveler) tour of the traveling salesman problem, we show that—regardless of the distance matrix—the landscape based on a quasiabelian Cayley graph belongs to the class of elementary landscapes, where the cost vector is an eigenvector of the Cayley Laplacian, and where local minima are below average.The quasiabelian case has the additional property that, because the cost vector is an eigenvector of the Cayley Laplacian, the landscape can be reduced into independent components under a Fourier transformation. We indicate the way this may result in parallel (and therefore computationally distributed) traversal of the landscape.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Optimization - Volume 6, Issue 3, August 2009, Pages 288–291
Journal: Discrete Optimization - Volume 6, Issue 3, August 2009, Pages 288–291
نویسندگان
Andrew Solomon, Bruce W. Colletti,