Improved graph clustering algorithm for logistics company alliance building problem

Logistics company alliance building problem studies that how to build alliance with a method of great rate and low cost. It presents an improved algorithm about graph clustering base on PSO to solve the problem. Optimize the clustering result through PSO, and expand the solution space through disturbance strategies in order to obtain the optimal solution. Experimental result shows that the algorithm can solve the problem in a high rate and low cost.