同时送取货车辆路径问题算法研究综述  

Algorithm review of vehicle routing problem with simultaneous delivery and pickup

作　　者：王科峰[1,2] 叶春明[1] 李永林[1] 

机构地区：[1]上海理工大学管理学院,上海200093 [2]河南理工大学能源科学与工程学院,河南焦作454000

出　　处：《计算机应用研究》2013年第2期334-340,共7页Application Research of Computers

基　　金：国家教育部人文社会科学规划基金资助项目(10YJA630187);高等学校博士点基金资助项目(20093120110008);河南省自然科学基金资助项目(122300410347)

摘　　要：针对同时送取货车辆路径问题的研究算法进行了评述。将该问题的求解方法分为精确算法、构造型启发式、现代启发式以及并行算法四个大类。从算法的原理、性能、适用环境,以及算法之间差异性等方面对各类算法进行了较为全面的介绍。最后,说明了VRPSDP算法研究在节点具有双重需求车辆路径问题理论研究方面的意义,并提出未来VRPSDP算法研究的两个发展方向,即适合多处理器上运行的并行现代启发式算法,以及有效的混合算法如量子行为粒子群算法。This paper gave a review about the algorithms for the vehicle routing problem with simultaneous delivery and pickup （VRPSDP）. It divided the solving methods into four main classes： exact algorithm, constructive heuristics algorithm, recta- heuristics algorithm, and parallel algorithm. It also gave the detail introductions of the algorithms from the principle, perform- ance, application environment, and the differences between them. In the end, it introduced the significance of the algorithm research of VRPSDP in the theory development of the vehicle routing problem with node having double demands. After that, it proposed two research directions in the future, which were parallel metaheuristics based on multiple processors, and the effec- tive hybrid algorithm such as quantum-behaved particle swarm optimization.

关 键 词：车辆路径问题 同时送取货 精确算法 构造型启发式算法 现代启发式算法 并行算法 

分 类 号：O221[理学—运筹学与控制论] U116.2[理学—数学]