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

带回送和时间窗的车辆路径问题的模型及算法
引用本文:尹传忠,卜雷,蒲云,赵宜. 带回送和时间窗的车辆路径问题的模型及算法[J]. 西南交通大学学报, 2006, 41(3): 290-295
作者姓名:尹传忠  卜雷  蒲云  赵宜
作者单位:1. 西南交通大学交通运输学院,四川,成都,610031
2. 同济大学交通运输工程学院,上海,200331
3. 深圳大学经济学院,广东,深圳, 518060
摘    要:在分析具有回送运输和时间窗的车辆路径问题特点的基础上,建立了该问题的优化数学模型,并通过设置与发货点距离为零的虚拟集货点使问题简化.在此基础上,构造了求解问题的改进遗传算法.在算法中,结合问题的特点设计了确保个体编码有效性的OX交叉算子,并采用基于Metropolis判别准则的复制算子,确保个体多样性和避免算法过早收敛.算例表明算法有效可行.

关 键 词:遗传算法 车辆路径问题 回送运输 时间窗 模型
文章编号:0258-2724(2006)03-0290-06
收稿时间:2004-11-04
修稿时间:2004-11-04

Model and Algorithm for Vehicle Routing Problem with Backhauls and Time Windows
YIN Chuanzhong,BU Lei,PU Yun,ZHAO Yi. Model and Algorithm for Vehicle Routing Problem with Backhauls and Time Windows[J]. Journal of Southwest Jiaotong University, 2006, 41(3): 290-295
Authors:YIN Chuanzhong  BU Lei  PU Yun  ZHAO Yi
Affiliation:1. School of Traffic and Transp. , Southwest Jiaotong University, Chengdu 610031, China; 2. School of Traffic and Trabso., Tongji University, Shanghai 200331, China; 3. School of Economics, Shenzhen Uniniversity, Shenzhen 518060, China
Abstract:The characteristic of vehicle routing problem with backhauls and time windows was analyzed. An optimization model was proposed. The problem was simplified by setting a virtual collecting depot, from which the distance to the consignment depot is zero. To solve the model, an improved genetic algorithm was presented. An OX-crossover operator was designed to keep individual codes valid, and the reproduction operator based on Metropolis criteria was used to guarantee the diversity of individuals and to avoid premature convergence. Experimental computation indicates that the algorithm is valid and feasible.
Keywords:genetic algorithm    vehicle routing problem    backhaul    time window   model
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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