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

带软时间窗的集货与送货多车辆路径问题节约算法
引用本文:祁文祥,陆志强,孙小明.带软时间窗的集货与送货多车辆路径问题节约算法[J].交通运输工程学报,2010(2).
作者姓名:祁文祥  陆志强  孙小明
作者单位:上海交通大学机械与动力工程学院;
基金项目:国家自然科学基金项目(70771065);;上海市浦江人才计划项目(07PJ14052)
摘    要:研究了物流配送中多车运输的集货与送货车辆路径规划问题,以增加时间惩罚费用的方式插入软时间窗约束,将租车费用、货车运输费用和时间惩罚费用三者之和最小作为优化目标,建立数学模型。采用启发式节约算法求解该模型,考虑时间惩罚费用和运输费用,比较每一配送节点上直接送货和间接送货的节约费用关系,求出最优配送路径。试验结果表明:当配送次数达到50次时,货车平均装载率仍能达到80%以上,该节约算法能减少货车空程行驶和租车次数,优化了全局费用。

关 键 词:多车辆路径问题  集货与送货  启发式节约算法  软时间窗  

Saving algorithm of multi-vehicle routing problem with pickup-delivery and soft time window
QI Wen-xiang,LU Zhi-qiang,SUN Xiao-ming.Saving algorithm of multi-vehicle routing problem with pickup-delivery and soft time window[J].Journal of Traffic and Transportation Engineering,2010(2).
Authors:QI Wen-xiang  LU Zhi-qiang  SUN Xiao-ming
Institution:School of Mechanical Engineering/a>;Shanghai Jiaotong University/a>;Shanghai 200240/a>;China
Abstract:Multi-vehicle routing problem with pickups and deliveries was studied,and soft time window constraint was considered by adding time punishment cost.The mathematical model was built,and its optimized object was the minimum of combination with vehicle rent cost,transportation cost and time punishment cost,and the model was solved by using heuristic saving algorithm.Time punishment cost and transpiration cost were calculated respectively,and the relation between direct and indirect deliveries was compared to o...
Keywords:multi-vehicle routing problem  pickup and delivery  heuristic saving algorithm  soft time window  
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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