带软时间窗的多种服务需求车辆调度问题及其禁忌搜索算法研究

Research on Multi-service Demand Vehicle Scheduling Problem with Soft Time Window and Tabu Search Algorithm

考虑到货主对货物有配送与安装的需求,研究了带软时间窗的多种服务需求车辆调度问题.将货物的安装、配送过程拆分独立,在配送车辆车厢装载体积限制和时间窗限制条件下,建立以配送费与安装费之和最小为目标函数的混合整数规划模型.在禁忌搜索算法的基础上,对解的构造方法与邻域变换规则进行改良.使用Lingo对多个算例进行精确求解,对比结果证明采用“分阶段”方法和改进禁忌搜索算法处理此类问题的有效性,为电商企业的配送与安装服务提供决策支持.

Considering the consignor's demand for goods distribution and installation,the vehicle scheduling problem with multiple service demands with soft time windows was studied.The process of goods installation and distribution was separated and independent,and a mixed integer programming model with the minimum sum of distribution cost and installation cost as the objective function was established under the conditions of loading volume restriction and time window restriction of distribution vehicles.On the basis of tabu search algorithm,the solution construction method and neighborhood transformation rules were improved.Lingo was used to solve several examples accurately.The comparison results prove that the“hierarchical approach”method and the improved tabu search algorithm are effective in dealing with such problems,and provide decision support for the distribution and installation services of e-commerce enterprises.