摘要
对车辆路径规划问题(V eh icle R ou ting P rob lem,VRP)领域的研究进行综述,根据目前的研究状况对该问题进行分类;分析该问题的图模型和数学模型两大类模型各自的优缺点;分四大类讨论求解该问题的算法:精确算法(exact a lgorithm),构造启发式算法(constructive heuristic a lgorithm),改进启发式算法(im prov ing heuristic a lgorithm),和亚启发式算法(m eta-heuristic a lgorithm),评述各类算法适用的问题求解阶段以及各自的优缺点;探讨国内在VRP领域的研究成果。在此基础上,对求解该问题的方法进一步的研究方向做了展望。
Focusing on vehicle routing problems （VRP）, this paper summarizes and reviews domestic and abroad researches on models and algorithms in this field comprehensively. First of all, we divide vehicle routing problems into different kinds according to values of their common attributes. Then, after introducing the graph model and mathematical model of the problem, we analyze the advantages and disadvantages of the two kinds of models. Besides that, we review four kinds of algorithms for VRP, exact algorithm, constructive heuristic algorithm, improving heuristic algorithm and meta-heuristic algorithm. On the basis of analyzing the past achievements and shortages,next research directions in the field are discused.
出处
《系统工程》
CSCD
北大核心
2006年第11期31-37,共7页
Systems Engineering
基金
国家自然科学基金资助项目(705710097017104070031020)
教育部科学技术研究重点项目(03052)
教育部博士点基金资助项目(20010141025)
辽宁省自然科学基金资助项目(2001101074)
