The traveling salesman problem (TSP) can be resolved by applying the whale optimization algorithm approach (WOAA), one appropriate optimization technique utilizing computer intelligence. However, there are a number of drawbacks to classical WOAA, such as low efficiency and slow convergence. A new WOAA method is presented that broadens diversify possible solution. This innovative method uses a strategy of merging pairs of searching whales in order to diversify the solution space. In addition, a threshold constant is introduced to lessen the impact of having a restricted number of meeting whales. The new algorithm is verified to have good performance based on applying it to 20 typical TSPs. Furthermore, the suggested novel algorithm performs better than most algorithms and is a very good way to solve the TSP, according to a comparison with 16 cutting-edge methods. Ultimately, by the resolution of 8 TSPs, the superior result of the novel method has been thoroughly examined through comparison with the standard traditional WOAA. The outcomes demonstrate that it can produce better results with less work and greater precision.