کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6893187 | 699353 | 2013 | 12 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
In this paper, we propose new heuristics using several path-relinking strategies to solve the Clustered Traveling Salesman Problem (CTSP). The CTSP is a generalization of the Traveling Salesman Problem (TSP) in which the set of vertices is partitioned into clusters and the objective is to find a minimum cost Hamiltonian cycle such that the vertices of each cluster are visited continuously. A comparison among the performance of the several different adopted path-relinking strategies is presented using instances with up to 2000 vertices and clusters varying between 4 and 150 vertices. Also computational experiments were performed to compare the performance of the proposed heuristics with an exact algorithm and a Genetic Algorithm. The obtained computational results showed that the proposed heuristics were able to obtain competitive results related to the quality of the solutions and computational execution time.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 40, Issue 12, December 2013, Pages 3218-3229
Journal: Computers & Operations Research - Volume 40, Issue 12, December 2013, Pages 3218-3229
نویسندگان
Mário Mestria, Luiz Satoru Ochi, Simone de Lima Martins,