کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
475777 699375 2013 13 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A memetic algorithm for the travelling salesperson problem with hotel selection
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
A memetic algorithm for the travelling salesperson problem with hotel selection
چکیده انگلیسی

In this paper, a metaheuristic solution procedure for the travelling salesperson problem with hotel selection (TSPHS) is presented. The metaheuristic consists of a memetic algorithm with an embedded tabu search, using a combination of well-known and problem-specific neighbourhoods. This solution procedure clearly outperforms the only other existing metaheuristic in the literature. For smaller instances, whose optimal solution is known, it is able to consistently find the optimal solution. For the other instances, it obtains several new best known solutions.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 40, Issue 7, July 2013, Pages 1716–1728
نویسندگان
, , , ,