摘要
为解决物流配送过程中某顾客时间窗变化而导致的物流配送难以按照原计划实现的难题,运用干扰管理方法,针对多车场带时间窗的物流配送车辆路径问题,提出包含顾客配送时间总偏离度、配送总成本、新路径方案与初始路径计划偏差量、最长行驶时间违反总量4个因素的扰动程度度量方法;以顾客时间窗变化这类干扰事件发生时的问题状态为基础,以系统整体扰动最小化为目标,建立问题的目标规划数学模型;针对这一复杂模型,提出基于特定邻域结构及其寻优概率的变邻域搜索算法;最后在标准算例上使用变邻域搜索算法与其他文献算法进行比较分析,结果表明该变邻域搜索算法对于干扰事件发生后的车辆路线重排结果在系统整体扰动程度方面明显优于其他文献的算法。
To deal with the problem that a distribution plan is hard to be executed when time windows of customers are changed,the methodology of disruption management was applied.Focused on multiple depot vehicle routing problems with time windows,a disruption measuring method was presented,which took the deviations from time windows of customers,transportation cost,the difference between the new routing plan and the initial one,and the violation degree to the longest routing time window into considerations.Based on the problem state that time window of a customer is changed,a goal programming mathematical model whose aim is minimizing system disruption was proposed,alonging with a variable neighborhood search algorithm based on specific neighborhood structures.Finally,a comparison between the proposed algorithm of the paper and an excellent algorithm for multiple depot vehicle routing problems with time windows was made on benchmark problems.The results show that the algorithm in the paper is significantly better than the algorithm from the literature in the aspect of the whole disruption degree of distribution system.
出处
《管理科学》
CSSCI
北大核心
2010年第3期103-112,共10页
Journal of Management Science
基金
国家自然科学基金(70801008
70671014)
国家杰出青年基金(70725004)
辽宁省博士启动基金(20071091
20081093)~~
关键词
顾客时间窗
车辆路径问题
物流配送
干扰管理
变邻域搜索算法
time windows of customers
vehicle routing problem
logistics and distribution
disruption management
variable neighborhood search algorithm
