摘要
物流配送车辆路径问题(VRP)属于NP-hard问题,对这类问题如何求解,学术界提出了多种算法,这些算法可归结为2大类:精确算法和启发式算法.通过对这2类算法中最具代表性的几种算法的分析、比较和总结,指出了各种算法的优缺点、适用范围和场合、存在的问题以及改进的方案,为物流配送车辆路径问题求解过程中算法的选择提供了依据和参考.
Vehicle Routing Problem （VRP） in logistics distribution is an NP- hard problem, how to resolve this problem,academia have put forward many algorithms. These algorithms can be clarified as accurate algorithm and heuristic algorithm. By analyzing, comparing, summarizing some representative algorithms, points out advantages, disadvantages, application scope and situation, problems, as well as improving project, provides the reference for selecting algorithm when resolving VRP ＇in logistics distribution.
出处
《沈阳工程学院学报（自然科学版）》
2006年第4期357-360,共4页
Journal of Shenyang Institute of Engineering:Natural Science
基金
福建省教育厅资助项目(JA03006)
关键词
物流配送
车辆路径问题
算法
logistics distribution
vehicle routing problem （VRP）
algorithm
