Multi-target urban logistics distribution path planning method

The invention discloses a multi-target urban logistics distribution path planning method. The method comprises the following steps: decomposing a three-target vehicle path problem with a time window into a plurality of single-target sub-problems through a group of uniformly distributed weight vectors; initializing the sub-problems by adopting a heuristic strategy; generating a filial generation for the sub-problem by using an evolutionary operator, and designing a target-oriented neighborhood operator to be combined with a variable neighborhood descent algorithm to serve as a local search strategy so as to improve the solving quality of the sub-problem; updating the solution of the sub-problem by adopting a Chebyshev aggregation function; optimizing a non-dominated solution in the archivesby adopting an external archive strategy based on a sorting and congestion degree mechanism; and S3, repeating the steps S3 to S4 until the set maximum number of iterations is reached, and providinga group of feasible vehicl