摘要
物流配送线路优化问题,即车辆路线问题(VRP,Vehicle Routing Problem)是组合优化领域中的著名NP(Nonlinear Programming)难题.本文以VRP为基础,建立该问题的数学模型,设计了改进的遗传算法,通过大量计算机计算分析验证,此改进算法对VRP有良好的近似解和较高的收敛速度.
VRP（Vchielc Routing Problem） is a well-known NP-Hard problem in the Combination and Optimiza- tion field. In this paper, a mathematical model has been built for VRP, and a modified genetic algorithm has been developed after a number of experiments. The results of computer program runs showed that we can obtain excellent solution with the new algorithm rapidly.
出处
《交通运输系统工程与信息》
EI
CSCD
2006年第6期120-124,共5页
Journal of Transportation Systems Engineering and Information Technology
关键词
遗传算法
优化
VRP
genetic algorithm
optimization
vehicle routing problem（VRP）
