Purpose: In order to more reasonably plan the vehicle distribution path, the minimum number of vehicles and the shortest path length are used to complete the distribution tasks for all customers. Methods: A particle swarm optimization (F-SDVRP) planning strategy based on particle swarm optimization was proposed. By ensuring that any fully loaded delivery vehicle is “optimally” from the distribution point during the delivery process. The distribution path is distributed to achieve the “optimal” requirement of the total route of the distribution, and the distribution order of the entire customer point is continuously optimized by the particle swarm algorithm. RESULTS: The simulation results show that the vehicle planning strategy in the paper obtains better results than the other methods in solving the problem of distribution of relevant customer points. In the case of the same number of vehicles, the maximum path reduction rate reaches 8.21%. In addition, the simulation results of the examples show that the stability of the strategy is better. Conclusion: Particle swarm algorithm can solve the problem of detachable vehicle path planning with full load requirements, but how to more reasonably split the needs of customer points and how to improve the optimization efficiency are still difficult points in path optimization.