摘要
随着铁路企业逐步向现代物流企业转型,铁路零担运输备受重视。为推动铁路零担运输发展,提高其服务质量,本文开展铁路零担货物集配网络作业优化研究,以铁路零担货物集货网络为研究对象,构建了考虑司机工作时长限制的带软时间窗的车辆路径优化模型,以总成本最小为目标函数,并相应改进设计禁忌搜索算法,利用MATLAB软件进行算例求解,与传统未考虑司机工作时长约束的VRPTW模型进行对比分析,验证了模型可行性及算法有效性,结果表明本文模型在较小的可接受的成本增加范围内,能更好地保障员工工作权益,同时提供更高的服务水平,为铁路零担运输实际应用提供参考价值。
With the gradual transformation of railway enterprises to modern logistics enterprises, railway lessthan-truckload transportation has been attached great importance. In order to promote the development of railway less-than-truckload transportation and improve its service quality, this paper carries out the research on the optimization of railway less-than-truckload goods collection and distribution network. Taking the railway less-than-truckload cargo collection network as the research object, this paper constructed a vehicle routing optimization model with soft time windows and the driver’s working time limit, and the model takes the minimum total cost as the objective function. An improved tabu search algorithm was correspondingly designed, and the MATLAB software was used to solve the example. Compared with the traditional VRPTW model without the driver’s working time constraint, the model in this paper is verified to be feasible and the algorithm is effective. The results show that the model in this paper can better protect the work rights and interests of employees within a small range of acceptable cost increase, and provide a higher service level, offering reference value for the practical application of railway less-than-truckload transportation.
作者
袁田甜
张锦
马啸来
肖斌
YUAN Tiantian;ZHANG Jin;MA Xiaolai;XIAO Bin(School of Transportation and Logistics,Southwest Jiaotong University,Chengdu 610031,China;National United Engineering Laboratory of Integrated and Intelligent Transportation,Southwest Jiaotong University,Chengdu 610031,China)
出处
《综合运输》
2020年第9期91-97,共7页
China Transportation Review
关键词
铁路零担运输
车辆路径优化
司机工作时长
软时间窗
禁忌搜索算法
Railway less-than-truckload transportation
Vehicle routing optimization
Driver’s working time
Soft time windows
Tabu search algorithm