Comparison between branch and cutting algorithm and ant colony algorithm in order to contribute solving the problem of postman Traveling Salesman Problem
published by Aِl-Baath University
in 2017
in
and research's language is
العربية
Download
Abstract in English
In this research we are studying the possibility of contributing in
solving the problem of the Traveling Salesman Problem, which is
a problem of the type NP-hard . And there is still no algorithm
provides us with the Optimal solution to this problem . All the
algorithms used to give solutions which are close to the optimal
one .
References used
DANTZIG, G.B., FULKERSON, D.R., JOHNSON, S.M, 1959 Solution of a large scale traveling salesman problem, Operation Research, vol. 2, 1954,pp.393-395
WILLIAM ,C. 2012 . In Pursuit of the Traveling Salesman ,Mathematics at the Limits of Computation , 245 P
APPLEGATE. D.L, R. BIXBY, V. CHVÁTAL, COOK .W.J, ESPINOZA. D , GOYCOOLEA .M, ANDHELSGAUN. K 2009 . Certification of an optimal tsp tour through 85,900 cities. pp ,1-3