基于禁忌搜索算法的物流系统车辆路径优化

增强物流企业的市场竞争力,提高配送效率、优化配送车辆路径、降低配送成本、增强客户满意度是关键。考虑到物流系统配送的现状,在传统配送路径模型的基础上加入软时间窗约束、配送车辆额定工作时间约束来分别反映客户的满意度、车辆的工作状态,以运输费用、非时间窗内服务产生的惩罚成本、车辆超时工作的折损成本、车辆启动成本4部分之和为目标函数,构建了带软时间窗的物流系统车辆路径模型。针对问题,在禁忌搜索算法的基础上,设置4种邻域变化规则来改进局部搜索;在有无时间窗条件下,分别用MATLAB对算例求解,比较配送路径的最佳方案与最低成本,验证模型和算法的有效性。

Research on Vehicle Routing Optimization of Logistics System Based on Tabu Search Algorithm

In order to enhance the market competitiveness of logistics enterprises, it is the key to improve distribution efficiency, optimize delivery vehicle routing, reduce distribution costs, and enhance the customer satisfaction. Considering the status quo of logistics system distribution, soft time window constraints and distribution vehicle rated working time constraints were added on the basis of the traditional distribution path model to reflected customer satisfaction and vehicle working status. The objective function includes the transportation cost, the penalty cost generated by the service in the non-time window, the derogation cost of the vehicle overtime work, and the vehicle startup cost. Then the Vehicle Routing Problem with Soft Time Windows was constructed. Based on the tabu search algorithm, set the neighborhood transformation rule to improve the local search. According to the tabu search algorithm, four kinds of neighborhood change rules were set to improve the local search. In the presence or absence of the time window, Matlab was used to solve the example and compare the best solution and the lowest cost of the distribution path. Verified the validity of the model and algorithm.