基于改进禁忌搜索算法的VRPSPDTW研究  

Research on VRPSPDTW Based on Improved Tabu Search Algorithm

作　　者：张思 王海 ZHANG Si;WANG Hai(School of Management,Shanghai University,Shanghai 200444,China)

机构地区：[1]上海大学管理学院,上海200444

出　　处：《物流科技》2020年第7期1-7,23,共8页Logistics Sci-Tech

基　　金：国家自然科学基金青年科学基金项目(71701123)。

摘　　要：为降低全程冷链下生鲜产品的配送成本,文章研究带时间窗的同时取送货车辆路径问题,建立一个考虑碳排放、能耗、货损等多项成本的运输配送模型。为了求解该模型,对标准禁忌搜索算法进行改进,RCRS算法生成较优初始解,WTS算法对路径进行编码与解码,响应性策略可以在搜索过程中动态调节禁忌长度,三种策略的加入提高了TS算法跳出局部最优的概率。通过对基准算例的计算,验证了三种改进策略对算法性能的提升,结果显示改进禁忌算法可以有效地解决VRPSPDTW问题。In order to reduce the distribution cost of fresh products under the whole cold chain,this paper studies the route problem of delivery vehicles with time window,and es tablishes a transportation and distribution model that takes into account carbon emission,energy consumption,cargo loss and other costs.In order to solve the model,the standard tabu search algorithm is improved.RCRS algorithm generates better initial solution.The WTS algorithm encodes and decodes the path,and the response strategy can dynamically adjust the tabu length during the search process.The addition of the three strategies improves the probability of TS algorithm jumping out of the local optimum.Through the calculation of the benchmark example,the performance improvement of the three improved strategies is verified.The results show that the improved tabu algorithm can effectively solve the VRPSPDTW problem.

关 键 词：冷链 车辆路径问题 禁忌搜索算法 

分 类 号：F250[经济管理—国民经济]