Research on High-dimensional Many-Objective Vehicle Routing Problem Based on NSGA/P
LIU Jun
QIN Qingfeng
PENG Funan
SHI Haiyan
Abstract：In order to overcome the shortcoming of NSGA-Ⅱ algorithm in solving high-dimensional multi-objective prob-lems,NSGA/P algorithm combined with MOEA/P makes up the deficiency of NSGAII.The feasibility of NSGA/P algorithm in solv-ing multi-depot high-dimensional many-objective vehicle routing problem with time windows is verified by testing the algorithm with Cordeau standard example.According to the characteristics of vehicle routing problem,this paper proposes a sub-path-based individual self-crossover,using sub-path as the parent of the traditional crossover operator.Compared with the classical crossover operator,the crossover operator designed in this paper has better results.For the consideration of logistics cost,individual custom-ers are not allowed to be served without affecting the scale of the example.Experiments show that when giving up individual custom-ers,logistics enterprises can better achieve the expected cost,cost-saving rate of up to 19.9%.
Keywords：vehicle routing problemhigh-dimensional many-objectivemulti-depotNSGA/P
Publication Date：2025-07-20
Online Publishing Date：2025-09-25(First online date of this platform, not the publication date of the document)
Pages：7( 1891-1896,2010 )