摘要
车辆路径问题(VRP)是物流管理研究的一项重要内容,在提高服务质量和降低成本方面起着关键作用。给出了车辆路径优化问题数学模型,介绍了免疫单克隆算法的基本原理,提出了免疫单克隆算法求解VRP的基本流程。算例计算结果表明,通过引入亲合度成熟、克隆和记忆机理,利用相应的算子,免疫单克隆算法可以快速地收敛到全局最优解,效果良好。
Vehicle routing problem（VRP）is an important content of logistics management research, which plays a crucial role in raising service quality and reducing cost. Based on the introduction of the basic principle of an immune monoclonal algorithm, the mathematic model of vehicle route optimization and its basic calculation process were given. The calculation results of an example show that the immune monoclonal algorithm can quickly obtain the overall optimum result and its effect is good through inducing join degree maturation, cloning, and memory mechanism, and utilizing corresponding calculation operator.
出处
《交通与计算机》
2008年第1期109-111,120,共4页
Computer and Communications
关键词
物流
车辆路径
免疫单克隆算法
优化
logistics
vehicle route
immune monoclonal algorithm optimization
