کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
472661 698737 2011 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Memetic Algorithm based on Improved Inver–over operator and Lin–Kernighan local search for the Euclidean traveling salesman problem
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
Memetic Algorithm based on Improved Inver–over operator and Lin–Kernighan local search for the Euclidean traveling salesman problem
چکیده انگلیسی

In this study, an Improved Inver–over operator is proposed to solve the Euclidean traveling salesman problem (TSP) problem. The Improved Inver–over operator is tested on 14 different TSP examples selected from TSPLIB. The application of the Improved Inver–over operator gives much more effective results regarding to the best and average error values than the Basic Inver–over operator. Then an effective Memetic Algorithm based on Improved Inver–over operator and Lin–Kernighan local search is implemented. To speed up the convergence capability of the presented algorithm, a restart technique is employed. We evaluate the proposed algorithm based on standard TSP test problems and show that the proposed algorithm performs better than other Memetic Algorithm in terms of solution quality and computational effort.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Mathematics with Applications - Volume 62, Issue 7, October 2011, Pages 2743–2754
نویسندگان
, , , ,