Results 191 to 200 of about 4,258 (228)
Some of the next articles are maybe not open access.
Traveling Salesman Problems with Profits
Transportation Science, 2005Traveling salesman problems with profits (TSPs with profits) are a generalization of the traveling salesman problem (TSP), where it is not necessary to visit all vertices. A profit is associated with each vertex. The overall goal is the simultaneous optimization of the collected profit and the travel costs.
Dominique Feillet +2 more
openaire +1 more source
The landscape of the traveling salesman problem
Physics Letters A, 1992Abstract The landscapes of traveling salesman problems are investigated by random walk techniques. The autocorrelation functions for different metrics on the space of tours are calculated. The landscape turns out to be AR(1) for symmetric TSPs. For asymmetric problems there can be a random contribution superimposed on an AR(1) behaviour.
Stadler, P., Schnabel, W.
openaire +3 more sources
The traveling-salesman problem (abstract)
Proceedings of the 1990 ACM annual conference on Cooperation - CSC '90, 1990The traveling-salesman problem is one of the classical NP-Complete problems. No current algorithms are available which can solve these problems in polynomial time, that is, the number of steps grows as a polynomial according to the size of the input. The traveling-salesman problem involves a salesman who must make a tour of a number of cities using the
Susan N. Twohig, Samuel O. Aletan
openaire +1 more source
Today's Traveling Salesman Problem
IEEE Robotics & Automation Magazine, 2010Heterogeneous unmanned aerial vehicles (UAVs) are being developed for several civil and military applications. These vehicles can differ either in their motion constraints or sensing/attack capabilities. This article uses methods from operations research to address a fundamental routing problem involving heterogeneous UAVs. The approach is to transform
Paul Oberlin +2 more
openaire +1 more source
On The Approximability Of The Traveling Salesman Problem
Combinatorica, 2006We show that the traveling salesman problem with triangle inequality cannot be approximated with a ratio better than $$\frac{{117}}{{116}}$$ when the edge lengths are allowed to be asymmetric and $$\frac{{220}}{{219}}$$ when the edge lengths are symmetric, unless P=NP.
Christos H. Papadimitriou +1 more
openaire +1 more source
The greedy travelling salesman's problem
Networks, 1979AbstractThe Travelling Salesman's Problem is to find a Hamilton path (or circuit) which has minimum total weight W*, in a graph (or digraph) with a non‐negative weight on each edge. The Greedy Travelling Salesman's Problem is “How much larger than W* can the total weight G* of the solution obtained by the Greedy Algorithm be?”.
openaire +2 more sources
On inverse traveling salesman problems
4OR, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yerim Chung, Marc Demange
openaire +2 more sources
The clustered traveling salesman problem
Computers & Operations Research, 1975Abstract The traveling salesman problem is expanded to include the situation where a group of cities (cluster) must be visited contiguously in an optimal, unspecified order. Given several sets of clusters within the problem, a method is developed for optimizing simultaneously the ordering of cities within each cluster and the ordering of clusters.
openaire +1 more source
The hierarchical traveling salesman problem
Optimization Letters, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kiran Panchamgam +4 more
openaire +2 more sources
Asparagos96 and the traveling salesman problem
Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97), 2002The paper describes a spatially structured evolutionary algorithm being applied to the symmetric and asymmetric traveling salesman problem (TSP). This approach shows that a genetic algorithm with high degree of isolation-by-distance in combination with a simple repairing mechanism is able to find high quality solutions for the TSP.
openaire +1 more source