Three easy special cases of the euclidean travelling salesman problem
نویسندگان
چکیده
منابع مشابه
Optimierung Und Kontrolle Projektbereich Diskrete Optimierung Three Easy Special Cases of the Euclidean Travelling Salesman Problem Three Easy Special Cases of the Euclidean Travelling Salesman Problem
It is known that in case the distance matrix in the Travelling Salesman Problem (TSP) fulllls certain combinatorial conditions (e.g. the Demidenko conditions , the Kalmanson conditions or the Supnick conditions) then the TSP is solvable in polynomial time. This paper deals with the problem of recognizing Euclidean instances of the TSP for which there is a renumbering of the cities such that the...
متن کاملEuclidean Traveling Salesman Problem
Since the computation of an exact solution is very expensive (under the assumption that P 6= NP ), we are interested in approximate solutions – at least for special cases. Particularly, we look for an Polynomial Time Approximation Scheme (PTAS), i.e., for any fixed error parameter ε > 0, the running time is bounded by a polynomial in n and the costs of the computed tour does not exceed (1+ε) ·O...
متن کاملSense of direction and conscientiousness as predictors of performance in the Euclidean travelling salesman problem
A salesperson wishes to visit a number of cities before returning home using the shortest possible route, whilst only visiting each city once. This optimization problem, called the Travelling Salesman Problem, is difficult to solve using exhaustive algorithms due to the exponential growth in the number of possible solutions. Interestingly, when presented in Euclidean space (ETSP), humans quickl...
متن کاملThe multi-stripe travelling salesman problem
In the classical Travelling Salesman Problem (TSP), the objective function sums the costs for travelling from one city to the next city along the tour. In the q-stripe TSP with [Formula: see text], the objective function sums the costs for travelling from one city to each of the next q cities in the tour. The resulting q-stripe TSP generalizes the TSP and forms a special case of the quadratic a...
متن کاملAnt colonies for the travelling salesman problem.
We describe an artificial ant colony capable of solving the travelling salesman problem (TSP). Ants of the artificial colony are able to generate successively shorter feasible tours by using information accumulated in the form of a pheromone trail deposited on the edges of the TSP graph. Computer simulations demonstrate that the artificial ant colony is capable of generating good solutions to b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Operations Research
سال: 1997
ISSN: 0399-0559,1290-3868
DOI: 10.1051/ro/1997310403431