Results 151 to 160 of about 11,422 (178)

On inverse traveling salesman problems

4OR, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yerim Chung, Marc Demange
openaire   +2 more sources

Asparagos96 and the traveling salesman problem

Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97), 2002
The 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

The traveling-salesman problem (abstract)

Proceedings of the 1990 ACM annual conference on Cooperation - CSC '90, 1990
The 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

Algorithms for the on-line travelling salesman

Algorithmica, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
AUSIELLO, Giorgio, E. Feuerstein, LEONARDI, Stefano, L. Stougie, M. Talamo   +4 more
openaire   +4 more sources

Submodularity and the traveling salesman problem

European Journal of Operational Research, 1999
Consider a central warehouse and a set \(V\) of retailers. For \(S \subseteq V\) let \(T(S)\) the length of an optimal traveling salesman tour through the retailers in \(S\) and the warehouse. The problem investigated is to find a submodular function \(K(S)\) and a small \(\alpha\) such that \(T(S)\leq K(S)\leq \alpha T(S)\) for all \(S\subseteq V ...
openaire   +2 more sources

TSPLIB—A Traveling Salesman Problem Library

ORSA Journal on Computing, 1991
Gerhard Reinelt
exaly  

A transformation technique for the clustered generalized traveling salesman problem with applications to logistics

European Journal of Operational Research, 2020
Pouya Baniasadi, Mehdi Foumani, Kate Smith-Miles   +2 more
exaly  

The multiple traveling salesman problem: an overview of formulations and solution procedures

Omega, 2006
Tolga Bektaş
exaly  

The traveling salesman problem: An overview of exact and approximate algorithms

European Journal of Operational Research, 1992
Gilbert Laporte
exaly  

A Priori Optimization of the Probabilistic Traveling Salesman Problem

Operations Research, 1994
Gilbert Laporte, Hélène Mercure
exaly