Computational experiments show that the greedy algorithm (GR) and the nearest neighbor algorithm (NN), popular choices for tour construction heuristics, work at acceptable level for the Euclidean TSP, but produce very poor results for the general Symmetric and Asymmetric TSP (STSP and ATSP). We prove that for every n2 there is an instance of ATSP (STSP) on n vertices for which GR finds the worst tour. The same result holds for NN. We also analyze the repetitive NN (RNN) that starts NN from every vertex and chooses the best tour obtained. We prove that, for the ATSP, RNN always produces a tour, which is not worse than at least n/2−1 other tours, but for some instance it finds a tour, which is not worse than at most n−2 other tours, n4. We al...
The travelling salesman problem is one of the NP-complete problems. It has been under consideration ...
Computational experiments show that the greedy algorithm (GR) and the nearest neighbor algorithm (NN...
It is widely confirmed by many computational experiments that a greedy type heuristics for the Trave...
Computational experiments show that the greedy algorithm (GR) and the nearest neighbor algorithm (NN...
Computational experiments show that the greedy algorithm (GR) and the nearest neighbor algorithm (NN...
Computational experiments show that the greedy algorithm (GR) and the nearest neighbor algorithm (NN...
Computational experiments show that the greedy algorithm (GR) and the nearest neighbor algorithm (NN...
AbstractComputational experiments show that the greedy algorithm (GR) and the nearest neighbor algor...
Computational experiments show that the greedy algorithm (GR)and the nearest neighbor algorithm (NN)...
We show that the 2-Opt and 3-Opt heuristics for the traveling salesman problem (TSP) on the complete...
We show that the 2-Opt and 3-Opt heuristics for the traveling salesman problem (TSP) on a complete g...
It is widely confirmed by many computational experiments that a greedy type heuristics for the Trave...
AbstractIn this paper we propose a general algorithm for the asymmetric traveling salesman problem (...
The domination number, domn(A, n), of a heuristic A for the Asymmetric TSP is the maximum integer d ...
The domination number, domn(A, n), of a heuristic A for the Asymmetric TSP is the maximum integer d ...
The travelling salesman problem is one of the NP-complete problems. It has been under consideration ...
Computational experiments show that the greedy algorithm (GR) and the nearest neighbor algorithm (NN...
It is widely confirmed by many computational experiments that a greedy type heuristics for the Trave...
Computational experiments show that the greedy algorithm (GR) and the nearest neighbor algorithm (NN...
Computational experiments show that the greedy algorithm (GR) and the nearest neighbor algorithm (NN...
Computational experiments show that the greedy algorithm (GR) and the nearest neighbor algorithm (NN...
Computational experiments show that the greedy algorithm (GR) and the nearest neighbor algorithm (NN...
AbstractComputational experiments show that the greedy algorithm (GR) and the nearest neighbor algor...
Computational experiments show that the greedy algorithm (GR)and the nearest neighbor algorithm (NN)...
We show that the 2-Opt and 3-Opt heuristics for the traveling salesman problem (TSP) on the complete...
We show that the 2-Opt and 3-Opt heuristics for the traveling salesman problem (TSP) on a complete g...
It is widely confirmed by many computational experiments that a greedy type heuristics for the Trave...
AbstractIn this paper we propose a general algorithm for the asymmetric traveling salesman problem (...
The domination number, domn(A, n), of a heuristic A for the Asymmetric TSP is the maximum integer d ...
The domination number, domn(A, n), of a heuristic A for the Asymmetric TSP is the maximum integer d ...
The travelling salesman problem is one of the NP-complete problems. It has been under consideration ...
Computational experiments show that the greedy algorithm (GR) and the nearest neighbor algorithm (NN...
It is widely confirmed by many computational experiments that a greedy type heuristics for the Trave...