Abstract
The solution for the traveling salesman problem is of importance because of its many application in the fields of engineering. Although many good solutions have been previously proposed for the traveling salesman problem, they are difficult to apply to practical large scale problems. In this paper we propose a new solution which can solve large scale problems covering more than 100 cities in high speed computation. In experiments using a computer (HITAC 8800 at TOKYO University Computing Center) the solution proposed in this paper succeeded in succeeded in solving 300-city problems in less than ten minutes. In this paper it will be shown that the success of this solution lies in effectively applying the branch and bound technique.
