一类特殊车辆路径问题(VRP)  

Special Kind of Vehicle Routing Problem

作　　者：李嘉[1] 王梦光[1] 唐立新[1] 宋建海[2] 

机构地区：[1]东北大学信息科学与工程学院,辽宁沈阳110004 [2]上海宝山钢铁集团(公司)计算机系统工程有限公司,上海201900

出　　处：《东北大学学报（自然科学版）》2001年第3期245-248,共4页Journal of Northeastern University(Natural Science)

基　　金：国家自然科学基金!资助项目 ( 7970 0 0 0 6)

摘　　要：描述了一类特殊的车辆路径问题 (VRP) -混合车队车辆路径问题·在分析问题特性的基础上 ,通过引入“车队模式”定义 ,提出了求解框架 ,设计了基于遗传算法和禁忌搜索启发式的混合算法·针对其中的混合车队车辆路径问题 ,所设计混合算法 ,利用了GA搜索全局性好 ,TS局部爬山能力强的特点·提出的车队、任务分段组合编码和解码规则充分考虑了混合车队车辆路径问题的特点·实例计算结果表明了框架。A special kind of vehicle routing problem was described and its characteristics were analyzed. By defining the “fleet pattern”, a solving framework was presented, and a hybrid GA composed of GA and TS was presented. For solving the heterogeneous fleet VRP, the hybrid algorithm integrates the advantage of GA (good at global searching) and TS (good at mountain climbing). The fleet task separately coding and decoding rules fully consider the characters of heterogeneous fleet VRP. The validity of the framework, model and algorithm were proved by some instances.

关 键 词：车辆路径问题 混合车队车辆 遗传算法 禁忌搜索 

分 类 号：O224[理学—运筹学与控制论]