|
|||||
|
|
| 市内集送货问题的混合禁忌搜索算法 | |
| 引用本文： | 曹剑东,郑四发,廖雁南,李兵,连小珉. 市内集送货问题的混合禁忌搜索算法[J]. 武汉理工大学学报(交通科学与工程版), 2009, 33(5): 848-851. DOI: 10.3963/j.issn.1006-2823.2009.05.009 |
| 作者姓名： | 曹剑东 郑四发 廖雁南 李兵 连小珉 |
| 作者单位： | 1. 交通部科学研究院,北京,100029 2. 清华大学汽车安全与节能国家重点实验室,北京,100084 3. 中国南方工业汽车股份有限公司,北京,100089 |
| 基金项目： | 北京市科委科技奥运专项基金项目资助(批准号:H030630020520) |
| 摘 要： | 针对单程多次装卸的市内集送货问题的数学模型,结合Clarke-Wright节约算法和2-opt邻域搜索算法设计混合禁忌搜索算法,给出算法初始可行解的生成策略,设计相应的候选集构造方法,并阐述了基于均衡原理的特赦准则和动态的禁忌长度选取策略.通过计算实例,说明了混合禁忌搜索算法求解市内集送货问题的有效性. |
| 关 键 词： | 集送货 禁忌搜索算法 节约算法 |
Optimization of the Urban Pickup and Delivery Problem with Hybrid Tabu Search Algorithm |
|
| Cao Jiandong,Zheng Sifa,Liao Yannan,Li Bing,Lian Xiaomin. Optimization of the Urban Pickup and Delivery Problem with Hybrid Tabu Search Algorithm[J]. journal of wuhan university of technology(transportation science&engineering), 2009, 33(5): 848-851. DOI: 10.3963/j.issn.1006-2823.2009.05.009 | |
| Authors: | Cao Jiandong Zheng Sifa Liao Yannan Li Bing Lian Xiaomin |
| Affiliation: | China Academy of Transportation Sciences;Beijing 100029;Tsinghua University;State Key Laboratory of Automotive Safety and Energy;Beijing 100084;China South Industries Motor Co.;Ltd;Beijing 100089 |
| Abstract: | This thesis is focused on the problem of urban pickup and delivery with one way multi load and unloads. Based on its mathematical model,hybrid Tabu Search Algorithm is designed out of 2-opt search algorithm in combination with Clarke-Wright Saving algorithm,strategy to create rational original solution is determined,method to construct corresponding candidate group is designed. Besides,strategy to select dynamic tabu length and aspiration criterion based on balancing principle are demonstrated in detail. Ca... |
| Keywords: | pickup and delivery tabu search algorithm saving algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |