节点文献
VRPTW的扰动恢复及其TABUSEARCH算法
RECOVERY OF THE VRPTW DISRUPTION AND THE TABU SEARCH ALGORITHM
【摘要】 本文对带时间窗的车辆路线安排扰动恢复问题进行了讨论,分析了各种可能的扰动:增加减少客户,时间窗、客户需求及路线可行性的扰动,构造了扰动模型.利用禁忌搜索算法对问题进行求解,同时通过对模型参数重新设置,得到了多个满足要求的不同的解,这样使解更具有实际可行性和有效性.
【Abstract】 In this paper, we discuss the recovery of the VRPTW(Vehicle Routing Problems with Time Windows)disruption and analyze the varied of disruption such as customers remove and addition, time window and demand disruption. and we propose a disruption model, We use Tabu Search algorithm to solve this problem, and design to achieve a small solution space by running the procedure with different parameter settings. This makes the solution with more validity and practical feasibility.
【关键词】 车辆路线问题;
时间窗;
扰动恢复;
禁忌搜索;
多解;
【Key words】 vehicle routing problem; time windows; disruption and recovery; Tabu Search; multiple solutions;
【Key words】 vehicle routing problem; time windows; disruption and recovery; Tabu Search; multiple solutions;
【基金】 国家自然科学基金资助项目(70471034,A0324666,79870091)
- 【文献出处】 数学杂志 ,Journal of Mathematics , 编辑部邮箱 ,2006年02期
- 【分类号】F224
- 【被引频次】67
- 【下载频次】250