| 有时间窗车辆路径问题的混合智能算法 |
| |
| 引用本文： | 张有华,张翠军,崔忠强.有时间窗车辆路径问题的混合智能算法[J].计算机工程与应用,2008,44(20):54-56. |
| |
| 作者姓名： | 张有华 张翠军 崔忠强 |
| |
| 作者单位： | 石家庄经济学院,信息工程学院,石家庄,050031 |
| |
| 基金项目： | 国家高技术研究发展计划(863计划)
,
河北省科学技术研究与发展计划
,
河北省教育厅科研项目 |
| |
| 摘 要： | 有时间窗的车辆路径问题属于组合优化领域中的NP-hard问题。在对该问题进行分析的基础上,为之建立了数学模型,提出了一种求解该问题的混合智能算法。该算法通过使用蚁群算法和遗传算法交替优化,并且及时交换信息,弥补了蚁群算法和遗传算法各自的不足,达到了优势互补的效果,增强了算法的寻优能力,避免了停滞现象。实验结果表明,该算法能有效解决有时间窗的车辆路径问题。
|
| 关 键 词： | 有时间窗车辆路径问题 NP-hard问题 蚁群算法 遗传算法 混合智能算法 |
| 收稿时间： | 2007-10-11 |
| 修稿时间： | 2008-1-4
|
Hybrid intelligence algorithm based on vehicle routing problem with time windows |
| |
| ZHANG You-hua,ZHANG Cui-jan,CUI Zhong-qiang.Hybrid intelligence algorithm based on vehicle routing problem with time windows[J].Computer Engineering and Applications,2008,44(20):54-56. |
| |
| Authors: | ZHANG You-hua ZHANG Cui-jan CUI Zhong-qiang |
| |
| Affiliation: | College of Information and Technology，Shijiazhuang University of Economics，Shijiazhuang 050031，China |
| |
| Abstract: | Vehicle routing problem with time windows is a NP-hard problem in combinatorial optimization field.Based on the analysis about it,a mathematical model is built and a hybrid intelligence algorithm for solving it is designed.The algorithm lets ant colony algorithm and genetic algorithm execute alternately and communicate timely in the optimization process.It learns the colony algorithm's and genetic algorithm's advantages and makes up their disadvantages.Thus its ability of optimization is enhanced and premature phenomenon is avoided.The experiment results show that the hybrid algorithm is efficient in solving vehicle routing problem with time windows. |
| |
| Keywords: | vehicle routing problem with time windows NP-hard problem ant colony algorithm genetic algorithm hybrid intelligence algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
