APPROXIMATE ALGORITHMS FOR SOLUTION THEBALANCED PROBLEM OF K TRAVEL SALESMAN | Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitelnaja tehnika i informatika – Tomsk State University Journal of Control and Computer Science. 2008. № 1 (2).

HomeIssuesAPPROXIMATE ALGORITHMS FOR SOLUTION THEBALANCED PROBLEM OF K TRAVEL SALESMAN | Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitelnaja tehnika i informatika – Tomsk State University Journal of Control and Computer Science. 2008. № 1 (2).

APPROXIMATE ALGORITHMS FOR SOLUTION THEBALANCED PROBLEM OF K TRAVEL SALESMAN

Considering building k looped tourstask on a set of n+1 towns with the minimal total length and with the same count of towns for each result tour (to within 1 town). One town called "base" should be included into each result tour and all other towns should be included into the only one tour of a result set. Offered and experimentally researched the several approximate algorithms for this task solution.

Download file
Counter downloads: 315

Keywords

задача коммивояжера , алгоритм разрезания маршрута , дихотомическое разделение , problem travel salesman , algorithm cutting up route , dichotomic division

Authors

NameOrganizationE-mail
Kostyuk Yu.L. kost@inf.tsu.ru
Pozhidaev M.S. mspv@inbox.ru
Всего: 2

References

Меламед И.И., Сергеев С.И., Сигал И.Х. Задача коммивояжера. Вопросы теории // Автоматика и телемеханика. 1989. № 9. С. 3 - 33.
Гэри М., Джонсон Д. Вычислительные машины и труднорешаемые задачи. М.: Мир, 1982.
Рейнголд Э., Нивергельд Ю., Део Н. Комбинаторные алгоритмы. Теория и практика. М.: Мир, 1980.
Johnson D.S., McGeoch L.A. The Traveling Salesman Problem: A Case Study in Local Optimization // Local Search in Combinatorial Optimization / Aarts E.H.L., Lenstra J.K. (eds.). N.Y.: John Willey & Sons, 1995.
APPROXIMATE ALGORITHMS FOR SOLUTION THEBALANCED PROBLEM OF K TRAVEL SALESMAN | Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitelnaja tehnika i informatika – Tomsk State University Journal of Control and Computer Science. 2008. № 1 (2).

APPROXIMATE ALGORITHMS FOR SOLUTION THEBALANCED PROBLEM OF K TRAVEL SALESMAN | Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitelnaja tehnika i informatika – Tomsk State University Journal of Control and Computer Science. 2008. № 1 (2).

Download file