基于混沌优化算法的车辆路径规划问题研究  

Study on Vehicle Routing Problem Based on Chaos Optimization Algorithm

作　　者：欧微[1] 李志凌[1] 

机构地区：[1]乌鲁木齐边防干部训练大队军事合成教研室,乌鲁木齐830002

出　　处：《科学技术与工程》2010年第29期7352-7355,共4页Science Technology and Engineering

摘　　要：考虑节点连通关系约束和路段通行能力差异的车辆路径规划(Vehicle Routing Problem,VRP)问题比传统的路径规划问题更为复杂,有效的求解算法一直是研究的关键问题。分析了该类VRP问题的数学模型,提出了一种针对该问题的混沌优化算法,介绍了具体的编码方法和实现算子。最后通过仿真实验,验证了所提算法的有效性。Vehicle Routing Problems（VRP）which takes the connection relationship restriction of traffic node and the capacity difference of roads into account is much more complex than traditional VRPs,Effective algorithms is the key problem of research work.The mathematic model of this VRP is analyzed,and a chaos optimization algorithm is proposed,then the coding method and compute operators are introduced.Finally,the efficiency of the proposed algorithm is demonstrated by computer simulations.

关 键 词：路径规划 混沌优化 编码方法 仿真计算 

分 类 号：U492.22[交通运输工程—交通运输规划与管理]