Travelling salesman problem is a kind of complex NP-hard combinatorial optimization problem, which can be approximated only by heuristic algorithms. In the paper, a hybrid heuristic heuristic algorithm is presented for the classical travelling salesman problem ( TSP ) and its extended form, such as bottleneck problem, multicriteria problem, etc. The algorithm offered consists of simulated annealing algorithm, genetic algorithm, genetic algorithm and ant algorithm. This composite algorithm and be modified to solve the extended TSP. Numerical examples are tested on microcomputers, which give satisfactory results.