卷烟承运标段划分模型研究

Study on the Model of Cigarette Transportation Segment Division

面对卷烟需求频次高、批量小,订单碎片化的趋势,合理的承运标段划分方法不仅有利于平衡各承运商的实际收益,也有利于提高拼车配载的可能性,从而降低运输成本。本文以最小化全部标段内部的需求点遍历路程之和为优化目标建立模型。在此基础上,本文提出了一种双层算法对模型进行求解,上层采用聚类方法获取具有较高可行性的初始解;下层基于边缘交换算法通过迭代对初始解进行优化,从而得到近似最优解。最后,本文以A中烟公司为例,在其近两年的订单量历史数据基础上进行了案例分析,验证了所提出模型与解决方法的有效性。

In the face of the trend of high-frequency cigarette demands,small batch sizes,and fragmented orders,a rational transportation segment division is not only conducive to balancing the actual income of each carrier,but also improves the possibility of carpooling and stowage,thus reducing the transportation cost.This paper establishes a model with the objective of minimizing the total traversing distance within all segments.On this basis,a two-tier algorithm is proposed to solve the model.The upper layer adopts clustering method to obtain the initial solution with high feasibility;the lower layer optimizes the initial solution iteratively based on edge-exchange algorithms to approach an optimal solution.Finally,taking Company A as an example and based on its order volume historical data from the recent two years,a case study is conducted to verify the effectiveness of the proposed model and solution method.