کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
1141620 957046 2006 8 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات کنترل و بهینه سازی
پیش نمایش صفحه اول مقاله
A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem
چکیده انگلیسی

We consider the standard dynamic program to solve the TSP. We then obtain exponentially large neighborhoods by selecting a polynomially bounded number of states, and restricting the dynamic program to those states only. We show how the Balas and Simonetti neighborhood and the insertion dynasearch neighborhood can be viewed in this manner. We also show that one of the dynasearch neighborhoods can be derived directly from the 2-exchange neighborhood using this approach.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Optimization - Volume 3, Issue 1, 1 March 2006, Pages 78–85
نویسندگان
, ,