| VRPSTW的混合改进蚁群优化算法* |
| |
| 引用本文： | 崔雪丽,马良.VRPSTW的混合改进蚁群优化算法*[J].计算机应用研究,2010,27(3):845-848. |
| |
| 作者姓名： | 崔雪丽 马良 |
| |
| 作者单位： | 1. 苏州科技学院,经济与管理学院,物流管理系,江苏,苏州,215011
2. 上海理工大学,管理学院管理科学与工程系,上海,200093 |
| |
| 基金项目： | 国家自然科学基金资助项目(70871081)；博士后科学基金资助项目(20060400583)；上海市(第三期)重点学科建设资助项目(S30504) |
| |
| 摘 要： | 软时间窗车辆路径问题（VRPSTW）是VRP的一种重要扩展类型，定义了其惩罚函数并建立数学模型。设计用于求解该问题的混合改进型蚁群算法并求解标准数据库中的紧时间窗实例。经过大量数据测试，获得了较好的效果，并验证了蚁群算法用于求解软时间窗车辆路径问题的成功实现。
|
| 关 键 词： | 软时间窗车辆路径问题 蚁群算法 惩罚函数 |
Hybrid improved ant algorithm for VRPSTW |
| |
| CUI Xue-li,MA Liang.Hybrid improved ant algorithm for VRPSTW[J].Application Research of Computers,2010,27(3):845-848. |
| |
| Authors: | CUI Xue-li MA Liang |
| |
| Affiliation: | 1.Dept.of Logistics Management/a>;College of Economy & Management/a>;Suzhou University of Science & Technology/a>;Suzhou Jiangsu 215011/a>;China/a>;2.Dept.of Management Science & Technology/a>;College of Management/a>;University of Shanghai for Science & Technology/a>;Shanghai 200093/a>;China |
| |
| Abstract: | Vehicle routing problem with soft time windows is a very important extended type of vehicle routing problem. This paper defined penalty function and established mathematical model of VRPSTW. Designed a hybrid improved ant algorithm for solving this problem and solved some Solomon instances with hard time windows. Computational experiments show that this approach is promising in good performances and verify the success of applying ant algorithm in solving vehicle routing problem with soft time windows. |
| |
| Keywords: | VRPSTW(vehicle routing problem with soft time windows) ant algorithm penalty function |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用研究》浏览原始摘要信息 |
|
点击此处可从《计算机应用研究》下载全文 |
