客户资源共享及需求可拆分的车辆路径问题  

Research on Model and Algorithm of Split Delivery Vehicle Routing Problem with Joint Distribution Mode

作　　者：罗佳[1] LUO Jia(Economics ＆Managernent School,Yibin University,Yibin 644000,China)

机构地区：[1]宜宾学院经济与管理学院,四川宜宾644000

出　　处：《广西民族大学学报（自然科学版）》2018年第3期64-69,共6页Journal of Guangxi Minzu University ：Natural Science Edition

摘　　要：随着物流量的剧增,物流企业之间的竞争力体现在配送速度及配送成本上.由于企业难以突破传统的竞争思维,物流领域的相关企业均是各自为政,难免会出现恶性竞争.加之我国目前物流设施设备、信息技术相对国外较落后,物流企业可以将区域内的客户资源共享、整合来提高收益.虽然目前已有配送中心之间进行了客户资源的共享,但因为没有正确整合而事倍功半.笔者在多个配送中心共享客户资源的情况下,考虑客户的需求可拆分,以车辆行驶距离最短为目标函数,建立二阶段模型,将聚类算法与模拟退火算法结合使用,求解二阶段模型.用聚类算法求出每个配送中心最优的配送范围,模拟退火算法求解出每个配送中心车辆的最优配送路线.最后结合数值案例,借助MATLAB验证算法的有效性.With the surge of logistics volume, the competitiveness between logistics enterprises is re flected in the delivery speed and delivery costs. Due to the difficulty of China＇s enterprises to break through the traditional competitive thinking, logistics related businesses are fragmented, it inevitably leads to vicious competition. Coupled with China＇s current logistics facilities and equipment, information technology is rela tively backward than foreign countries, logistics enterprises in the region can share and integrate the custom er resources to increase revenue. Although there has been sharing of customer resources between distribution centers, they are less effective because they are not properly integrated. In this paper, when multiple distri bution centers share customer resources, considering the needs of customers considered the shortest driving distance as the objective function is established algorithm and simulated annealing algorithm to solve the two stage model. The paper uses the clustering algorithm to find out the optimal distributing range and the simulated annealing algorithm to get the optimal delivery route. Finally taking use of MATI.AB verified the effectiveness of the algorithm through numerical examples.

关 键 词：物流工程 二阶段模型 聚类算法 模拟退火算法 路径优化 

分 类 号：U116.2[交通运输工程]