الگوریتم های اکتشافی برای مشکل مسافران فروشنده متعادل شده 2 دوره در نمودار اقلیدسی
|کد مقاله||سال انتشار||مقاله انگلیسی||ترجمه فارسی||تعداد کلمات|
|79627||2011||10 صفحه PDF||سفارش دهید||8933 کلمه|
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : European Journal of Operational Research, Volume 208, Issue 3, 1 February 2011, Pages 253–262
In the 2-period Travelling Salesman Problem some nodes, called double nodes, are visited in both of two periods while the remaining ones, called single nodes, are visited in either one of the periods. In this paper we study the case in which a balance constraint is also introduced. We require that the difference between the number of visited nodes in the two periods must be below a fixed threshold. Moreover, we suppose that distances between nodes are Euclidean. The problem is NP-hard, and exact methods, now available, appear inadequate. Here, we propose three heuristics. Computational experiences and a comparison between the algorithms are also given.