带服务优先级车辆路径问题的扫描禁忌搜索算法 |
| |
引用本文: | 黎金玲,陈燕,王德运,郭海湘,杨娟. 带服务优先级车辆路径问题的扫描禁忌搜索算法[J]. 数学的实践与认识, 2014, 0(9) |
| |
作者姓名: | 黎金玲 陈燕 王德运 郭海湘 杨娟 |
| |
作者单位: | 中国地质大学(武汉)经济管理学院;中国地质大学江城学院;中国地质大学远程与继续教育学院; |
| |
基金项目: | 国家自然科学基金(71103163,71103164,71301153);教育部新世纪优秀人才支持计划(NCET13-1012);教育部人文社会科学研究青年基金(10YJC790071);中央高校基本科研业务费专项资金资助(CUG110411,CUG120111,G2012002A,CUG140604) |
| |
摘 要: | 提出了一种带服务优先级车辆路径问题的模型(Vehicle Routing Problem with Precedence Constraints,VRPPC),和一种扫描—禁忌搜索算法(sweep-Taboo Search Algorithm,S-TSA).然后,运用S-TSA对郑煤物资供销有限公司的带有服务优先级的危险物资配送进行优化求解,并与扫描遗传算法(sweep-Genetic Algorithm,SGA),禁忌搜索算法(Taboo Search Algorithm,TSA),人工鱼群算法(Artificial Fish Algorithm,AFA)进行比较研究,研究结果显示:扫描禁忌搜索算法能在满足服务优先级的前提下,使配送费用最少.
|
关 键 词: | 车辆路径问题 服务优先级 扫描法 禁忌搜索算法 |
Sweep-Taboo Search Algorithm for Vehicle Routing Problem with Precedence Constraints |
| |
Abstract: | This paper presents a model for Vehicle Routing Problem with Precedence Constraints and a Sweep-Taboo Search Algorithm(S-TSA) which can effectively solve the VRPPC problem.Secondly,the paper applies S-TSA to solve the distribution of dangerous materials of Zhengzhou Coal Electricity Group Company.It also compares S-TSA with Sweep-Genetic Algorithm(S-GA),Taboo Search Algorithm(TSA) and Artificial Fish algorithms(AFA).The results show that under the precondition of satisfied precedence constraints,S-TSA can get the least cost in overall distribution fees. |
| |
Keywords: | vehicle routing problem precedence constraints sweeping algorithm taboo search algorithm |
本文献已被 CNKI 等数据库收录! |
|