首页 | 本学科首页   官方微博 | 高级检索  
     

多集散点单车路径优化研究
引用本文:王素欣,高利,崔小光,陈雪梅.多集散点单车路径优化研究[J].控制工程,2007,14(6):572-575.
作者姓名:王素欣  高利  崔小光  陈雪梅
作者单位:1. 北京理工大学,机械与车辆工程学院,北京,100081
2. 北京中软国际信息技术有限公司,北京,100081
摘    要:为使多集散点车辆路径优化结果全局最优,详细化表示货运关系,建立多集散点单车路径优化模型,并以订单为基准建立蚁群算法的二维禁忌表,确定状态转移规则;在满足车辆约束条件下,以最短路径完成所有订单货运的单车路径搜索。车辆路径全局优化是由于模型货运关系明细化及算法中车对所需运送订单的全局访问。实例求解结果表明,改进的优化模型及蚁群算法可以有效获得多集散点单车路径。

关 键 词:车辆路径优化  多集散点  蚁群算法  禁忌表
文章编号:1671-7848(2007)06-0572-04
修稿时间:2006年8月30日

Research on Multi-depot Single Vehicle Routing Problem
WANG Su-xin,GAO Li,CUI Xiao-guang,CHEN Xue-mei.Research on Multi-depot Single Vehicle Routing Problem[J].Control Engineering of China,2007,14(6):572-575.
Authors:WANG Su-xin  GAO Li  CUI Xiao-guang  CHEN Xue-mei
Abstract:In order to get global solution in multi-depot vehicle routing problem(VRP),freight relation is expressed in details,and single vehicle routing problem models are established for multi-depots.A two-dimension tabu table based on orders is established for ant colony optimization algorithm,and state transfer rule is built.Within vehicle constraint,vehicle routing is searched with short routing line.Reasons for getting global solution are particular VRP model and order global visit.Illustration results show that the modified model and ant colony optimization algorithm are effective in multi-depots vehicle routing problem.
Keywords:vehicle routing problem  multi-depots  ant colony optimization  tabu table
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号