In order to overcome the shortcomings of the resource integration and sharing and the design of a cooperative profit distribution mechanism in the open-closed hybrid vehicle routing optimization of multi-center joint distribution, an open-closed hybrid vehicle routing problem of multi-center joint distribution is proposed. First, an optimization model is proposed to minimize the total logistics operating cost, including transportation cost, penalty cost, vehicle rental cost, and distribution cost. Then, according to the characteristics of the model, a three-dimensional K-means clustering algorithm is designed to consider the geographical locations and time window constraints of customers, and a genetic algorithm-particle swarm hybrid optimization is proposed to solve the model. The proposed algorithm designs a selective granting mechanism between the genetic algorithm and particle swarm algorithm to improve the diversity of the population and the convergence of the obtained optimal solutions, and enhance the local and global search capabilities. Next, a cost gap allocation method is employed to study the profit allocation optimization of the multi-center joint distribution. Afterwards, the strict monotonic path principle is used to study the selection of alliance cooperation sequences, and then the stability of multi-center joint distribution alliance is discussed. Finally, the proposed model and algorithm are validated via the comparison and analysis of algorithms and a real-world case study, the differences of the indicators in the multi-center joint distribution optimization schemes with different distribution modes are compared and analyzed, and the effectiveness and applicability of the proposed method are further verified. This paper can provide a method reference and decision support for the study of the multi-echelon multi-center joint distribution network optimization problem.