带软时间窗的需求依订单拆分车辆路径问题及其禁忌搜索算法

发布时间：2018-02-15 12:21

本文关键词： 车辆路径问题需求依订单拆分软时间窗禁忌搜索算法　出处：《中国管理科学》2017年05期 　论文类型：期刊论文

【摘要】：需求可拆分车辆路径问题是车辆路径问题中的重要类型,又可分为需求可任意(按计量单位)拆分和需求依订单拆分两种子类型,在配送车辆路径优化等实际问题中有着广泛的应用背景。综合考虑客户需求依订单拆分和客户对于被服务时间的要求,本文针对带软时间窗的需求依订单拆分车辆路径问题及其优化算法进行研究。建立了问题的数学模型,设计了求解的禁忌搜索算法,以Solomn标准算例为基础构造算例对算法进行测试,并将求解结果与相关文献中的结果进行比较。结果表明,算法收敛性较好,为解决该类问题提供了一种方法。
[Abstract]:The demand-divisible vehicle routing problem is an important type of vehicle routing problem, which can be divided into two subtypes: the demand can be split arbitrarily (in units of measurement) and the demand can be split according to the order. It has a wide application background in the practical problems such as distribution vehicle path optimization and so on. Considering the split of customer demand according to order and customer's request for service time synthetically, In this paper, the vehicle routing problem with soft time window and its optimization algorithm are studied. The mathematical model of the problem is established, and the Tabu search algorithm for solving the problem is designed. Based on the Solomn standard example, the algorithm is tested and compared with the results in related literatures. The results show that the convergence of the algorithm is good, which provides a method for solving this kind of problem.
【作者单位】：中南大学交通运输工程学院;
【基金】：国家自然科学基金资助项目(71271220)
【分类号】：F252.1;TP18

【相似文献】