| 求解车辆路径问题的混合蚂蚁系统 |
| |
| 引用本文： | 詹玉洪.求解车辆路径问题的混合蚂蚁系统[J].计算技术与自动化,2010,29(1):138-141. |
| |
| 作者姓名： | 詹玉洪 |
| |
| 作者单位： | 福建省湄洲湾职业技术学校,福建,莆田,351254 |
| |
| 摘 要： | 研究车辆路径问题在物流配送系统中具有十分的重要意义。带时间窗车辆路径问题是每个客户的配送都有一个时间间隔限制的一类车辆路径问题。结合最大一最小蚂蚁系统、蚁群系统和最优一最差蚂蚁系统，提出求解带时间窗车辆路径问题的混合蚂蚁系统。实验结果表明：HAS能够有效地解决客户聚簇分布的带时间窗车辆路径问题。
|
| 关 键 词： | 车辆路径问题 时间窗 蚂蚁系统 |
Hybrid Ant System for Vehicle Routing Problem |
| |
| ZHAN Yu-hong.Hybrid Ant System for Vehicle Routing Problem[J].Computing Technology and Automation,2010,29(1):138-141. |
| |
| Authors: | ZHAN Yu-hong |
| |
| Affiliation: | ZHAN Yu-hong (Meizhouwan Vocational Technology School, Putian 351254,China) |
| |
| Abstract: | Research on vehicle routing problem is of great importance in logistics distribution system. Vehicle routing prohlem with time windows is a type of vehicle routing problem which customer＇s delivery has a time interval limits. In this paper, Hybrid Ant System is proposed for solving vehicle routing problem with time windows based on MAX-- MIN Ant System, Ant Colony System and Best--Worst Ant System. The results show that.. HAS can effectively solve vehicle routing problem with time windows which the distribution of client is clustered. |
| |
| Keywords: | vehicle routing problem time window ant system |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算技术与自动化》浏览原始摘要信息 |
|
点击此处可从《计算技术与自动化》下载全文 |
