Xu Sheng-Hua, Liu Ji-Ping, Zhang Fu-Hao, Wang Liang, Sun Li-Jian
Research Center of Government GIS, Chinese Academy of Surveying and Mapping, 28 Lianhuachi West Road, Haidian District, Beijing 100830, China.
Sensors (Basel). 2015 Aug 27;15(9):21033-53. doi: 10.3390/s150921033.
A combination of genetic algorithm and particle swarm optimization (PSO) for vehicle routing problems with time windows (VRPTW) is proposed in this paper. The improvements of the proposed algorithm include: using the particle real number encoding method to decode the route to alleviate the computation burden, applying a linear decreasing function based on the number of the iterations to provide balance between global and local exploration abilities, and integrating with the crossover operator of genetic algorithm to avoid the premature convergence and the local minimum. The experimental results show that the proposed algorithm is not only more efficient and competitive with other published results but can also obtain more optimal solutions for solving the VRPTW issue. One new well-known solution for this benchmark problem is also outlined in the following.
本文提出了一种将遗传算法与粒子群优化(PSO)相结合用于带时间窗车辆路径问题(VRPTW)的方法。所提算法的改进包括:采用粒子实数编码方法对路径进行解码以减轻计算负担,基于迭代次数应用线性递减函数以在全局和局部探索能力之间取得平衡,以及与遗传算法的交叉算子相结合以避免早熟收敛和局部最小值。实验结果表明,所提算法不仅更高效且与其他已发表结果相比具有竞争力,而且在解决VRPTW问题时还能获得更多最优解。接下来还概述了针对此基准问题的一种新的著名解决方案。