On update-mechanism algorithm of Online Traveling Salesman Problems

An online TSP which is described in this paper is to find a optimal Hamiltonian cycle in a real-time weighted symmetric graph. The real-time is that the weight of edge can be changed continuously and the method can answered rapidly to adjust the routes. A hybrid strategy which is based on the tabu search and genetic algorithm is proposed in this paper and an update operator is added into the strategy. Experiments using the 30-city of China TSP shows that the proposed method is superior and feasibility.