Discrete brain storm optimization algorithm based on prior knowledge for traveling salesman problems

An improved version of Brain Storm Optimization (BSO) which is called Discrete BSO algorithm based on prior knowledge is proposed in this paper to solve traveling salesman problems. Different from classical BSO Discrete Brain Storm Optimization algorithm based on prior knowledge (PKDBSO) creates the initial by the mathematical analysis method obtained non-crossing route. Apply the clustering algorithm in the objective space instead in the solution space. The novel individual generation strategy is defined for TSP problem. Different benchmark TSP problem are simulated to verify the effectiveness of the proposed Discrete BSO algorithm.