摘要
车辆路径问题(VRP)是图论中的NP问题,目前求解这类问题的算法可分为:精确算法、经典启发式算法和现代启发式算法三类;对这三类算法中最具代表性的几种算法进行了分析指出了其适用范围和场合、存在的问题以及改进的方案;最后,对其研究前景进行了展望。
Vehicle routing problem (VRP) is a graph theory of NP problems, the current algorithm for solving such problems can be divided into: Exact algorithms, classic and modem heuristic algorithm for the three types of heuristics; In this paper, analysised the scope ,the problems and occasions of these three types of algorithms, and the methods to improve the program; Finally, given the research prospects.
作者
马磊
MA Lei (College of Computer Science, SCUFN, Wuhan 430074, China)
出处
《电脑知识与技术》
2009年第7期5298-5300,共3页
Computer Knowledge and Technology
关键词
车辆路径问题
经典算法
启发式算法
蚁群算法
vehicle routing problem
classic algorithm
heuristic algorithm
ant colony algorithm