The on-line asymmetric traveling salesman problem

Abstract

We consider two on-line versions of the asymmetric traveling salesman problem with triangle inequality. For the homing version, in which the salesman is required to return in the city where it started from, we give a 3 + 5 2 -competitive algorithm and prove that this is best possible. For the nomadic version, the on-line analogue of the shortest asymmetric Hamiltonian path problem, we show that the competitive ratio of any on-line algorithm depends on the amount of asymmetry of the space in which the salesman moves. We also give bounds on the competitive ratio of on-line algorithms that are zealous, that is, in which the salesman cannot stay idle when some city can be served.