Vehicle path planning problem is widely used in logistics industry.To solve this NP difficult combinatorial optimization problem,an improved pollination algorithm for solving vehicle routing problem with time windows was proposed.For the polli-nation of flowers,there are some shortcomings such as low precision of optimization and premature of falling into local optimum.The crossover and mutation factors of genetic algorithm were introduced into the pollination algorithm of flower,and the multi-point crossover operator and single parent multipoint gene mutation transposition operator based on elite fathers were designed.The transformation probability p in the pollination algorithm of the flower was adaptively adjusted and the global pollination and the local pollination operations were redefined.The algorithm was tested using an international standard test set Solomon,and results obtained were compared with those obtained using known algorithms.The results show that the improved pollination algorithm is feasible and effective in solving the vehicle routing problem with time windows.
关键词
花授粉算法/遗传算法/路径优化/时间窗/自适应/算法改进/物流配送
Key words
flower pollination algorithm/genetic algorithm/path optimization/time window/adaptive/improvement of algo-rithm/logistics distribution
维普
万方数据