首页 | 官方网站   微博 | 高级检索  
     

VRPTW的扰动恢复及其TABU SEARCH算法
引用本文:王明春,高成修,曾永廷.VRPTW的扰动恢复及其TABU SEARCH算法[J].数学杂志,2006,26(2):231-236.
作者姓名:王明春  高成修  曾永廷
作者单位:武汉大学数学与统计学院,湖北,武汉,430072
基金项目:国家自然科学基金资助项目(70471034,A0324666,79870091)
摘    要:本文对带时间窗的车辆路线安排扰动恢复问题进行了讨论,分析了各种可能的扰动:增加减少客户,时间窗、客户需求及路线可行性的扰动,构造了扰动模型.利用禁忌搜索算法对问题进行求解,同时通过对模型参数重新设置,得到了多个满足要求的不同的解,这样使解更具有实际可行性和有效性.

关 键 词:车辆路线问题  时间窗  扰动恢复  禁忌搜索  多解
文章编号:0255-7797(2006)02-0231-06
收稿时间:2004-10-08
修稿时间:2004-10-082005-04-08

RECOVERY OF THE VRPTW DISRUPTION AND THE TABU SEARCH ALGORITHM
WANG Ming-chun,GAO Cheng-xiu,ZENG Yong-ting.RECOVERY OF THE VRPTW DISRUPTION AND THE TABU SEARCH ALGORITHM[J].Journal of Mathematics,2006,26(2):231-236.
Authors:WANG Ming-chun  GAO Cheng-xiu  ZENG Yong-ting
Affiliation:School of Math. and Statistics , Wuhan University, Wuhan 430072 ,China
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.
Keywords:vehicle routing problem  time windows  disruption and recovery  Tabu Search  multiple solutions  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号