An asymptotic approximation of the traveling salesman problem with uniform non-overlapping time windows

Omar Rifki (1) , Thierry Garaix (2) , Christine Solnon (3)

1 CIS - MINES - Centre Ingénierie Santé, Saint-Étienne
2 CIS-ENSMSE - Centre Ingénierie et Santé
3 CHROMA - Robots coopératifs et adaptés à la présence humaine en environnements dynamiques

We develop a continuous asymptotic approximation of the traveling salesman problem with time windows in the Euclidean plane, constructing upon the well-known Beardwood-Halton-Hemmersley theorem. The time windows are taken to be a partition of a given time horizon. Computational experiments on random TSP with time windows instances show that the proposed asymptotic approximations of tour lengths and arrival times are close to the actual optimal values.

Domaines: Informatique [cs]

Omar Rifki, Thierry Garaix, Christine Solnon. An asymptotic approximation of the traveling salesman problem with uniform non-overlapping time windows. CASE 2021 - IEEE 17th International Conference on Automation Science and Engineering, Aug 2021, Lyon, France. pp.1-6, ⟨10.1109/CASE49439.2021.9551615⟩. ⟨hal-03270043⟩