Traveling Salesman Problem (TSP) is one of the most classically studied problems in computational mathematics. It is essentially focused on optimization. In this paper, a hybrid algorithm of combining Brain Storm Optimization (BSO) with Discrete Particle Swarm Optimization (DPSO) is presented. The hybrid algorithm borrows exchange operator from DPSO and employs inversion idea from chromosome structure. To evaluate the performance of the proposed algorithm, it is applied to data sets from the TSPLIB standard database in comparison with the other algorithms. Experimental results show that the proposed hybrid algorithm can deal with the TSP problems well, and the developed mutation process and local search technique are effective.