带软时间窗的集配货一体化VRP改进模拟退火算法优化研究

Optimizing research of an improved simulated annealing algorithm to soft time windows vehicle routing problem with pick-up and delivery

建立了考虑软时间要求、配送车辆出行固定成本以及车辆出发满载系数等因素,更加符合实际的集配货一体化车辆路径问题数学模型.求解时对传统的模拟退火算法进行了改进,结合线路内交换和线路间交换产生新解,增加了记忆功能,采用了双终止准则.对一定规模的算例验算表明,该算法求解更优,稳定性更好,计算效率也更高.

This paper establishes a more practical mathematical model of vehicle routing problem with pick-up and delivery, which considers the soft time request, vehicle fixed cost of vehicle and vehicle full-load coefficient. To solve the model, the paper improves the traditional simulation annealing algorithm, unifying the exchange in the lines and between the lines produces the new solution, through increasing the memory function, using the double termination criterion. We test the new algorithm through a certain scale example, the experimental results show that the new algorithm can obtain better solution, better stability, and high calculation efficiency.