物流配送车辆调度问题算法综述

Research on Algorithm of Delivery Vehicle Routing Problems

配送车辆调度优化问题旨在解决配送中路径和车辆调度问题的一类组合优化问题,是近年来物流控制优化领域的研究热点。文章对运输调度问题进行了分类总结,给出总体模型的概括描述,分析遗传算法、模拟退火算法、禁忌搜索算法、蚁群算法和微粒群算法的特点及其在求解配送车辆调度优化问题中的求解思路,并讨论了其求解现状,对未来研究方向进行展望,指出改进混合现有算法,开拓新算法将是更有效解决配送车辆调度问题的好方法。

Delivery vehicle routing problems （VRP） is a kind of optimization problems, aiming at solving the vehicle routing problems in delivery section. And they have been a focus of research in logistics control optimization recently. After summarize different kinds of VRP, the article gives the relevant general models. The character and the application of genetic algorithm, simulated annealing, tabu search, ant colony algorithm, particle swarm optimization are analyzed and the current possibilities to solve VRP are also discussed. Finally, the development of VRP solution is presented, and point out that improved combined algorithm as well as new algorithm will be important measures to solve VRP.