首页 | 官方网站   微博 | 高级检索  
     

不确定环境下多品类共同配送路径优化
引用本文:葛显龙,薛桂琴.不确定环境下多品类共同配送路径优化[J].计算机工程与应用,2019,55(9):264-270.
作者姓名:葛显龙  薛桂琴
作者单位:1.重庆交通大学 经济与管理学院,重庆 400074 2.重庆交通大学 智能物流网络重点实验室,重庆 400074
基金项目:国家自然科学基金(No.71502021;No.71602015;No.71702016);教育部人文社会科学基金(No.2014YJC630038;No.2015XJC630007);博士后科学基金(No.2016T90862);重庆市基础与前沿研究项目(No.cstc2016jcyjA0160);重庆市教委人文社会科学研究项目(No.17SKG073);重庆市科学技术研究项目(No.KJ1500702)
摘    要:针对动态事件对配送过程的干扰问题,提出多品类共同配送车辆路径优化问题。基于对不确定环境下动态客户时空特性的分析,提出利用时空泊松分布生成动态客户的方法;并从整体运营成本及车辆固定成本入手,建立不确定环境下多品类共同配送模型;鉴于考虑模型的特殊性,设计遗传-禁忌搜索组合优化算法,结合具体算例对模型和算法性能进行验证。结果表明,提出的多品类共同配送方法优于单品类配送方法,且改进后的遗传-禁忌搜索算法具有更强的寻优能力。

关 键 词:物流工程  共同配送  遗传禁忌算法  多品类  车辆路径问题  不确定性

Multi-Products Joint Distribution Vehicle Routing Optimization with Uncertain Circumstance
GE Xianlong,XUE Guiqin.Multi-Products Joint Distribution Vehicle Routing Optimization with Uncertain Circumstance[J].Computer Engineering and Applications,2019,55(9):264-270.
Authors:GE Xianlong  XUE Guiqin
Affiliation:1.School of Economics and Management, Chongqing Jiaotong University, Chongqing 400074, China 2.Key Laboratory of Intelligent Logistics Network, Chongqing Jiaotong University, Chongqing 400074, China
Abstract:In view of the interference of dynamic events in distribution process, this paper proposes the multi-products joint distribution vehicle routing problem. Based on the dynamic events in uncertain circumstance, this paper proposes a space-time passion distribution method to generate dynamic customers and buils the multi-products joint distribution vehicle routing problem with uncertain circumstance accordingly for the sake of the minimum the overall operating cost and fixed cost. For the particularity of this issues, a combination of genetic algorithm and Tabu search algorithm is designed and its performance is tested by a set of specific examples. The results show that the multi-products joint distribution method is superior to the single one, and the improved combinational algorithm has a better find-best ability.
Keywords:logistics engineering  joint distribution  a combination of genetic algorithm and Tabu search algorithm  multi-products  vehicle routing problem  uncertainty  
本文献已被 维普 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号