| 一类求解带时间窗的团队定向问题的改进蚁群算法 |
| |
| 引用本文： | 柯良军,章鹤 尚可,冯祖仁. 一类求解带时间窗的团队定向问题的改进蚁群算法[J]. 计算机科学, 2012, 39(4): 214-216 |
| |
| 作者姓名： | 柯良军 章鹤 尚可 冯祖仁 |
| |
| 作者单位： | 西安交通大学机械制造与系统工程国家重点实验室 西安710049 |
| |
| 基金项目： | 国家重点基础研究发展计划项目，国家自然科学基金，教育部博士点基金，博士后特别基金 |
| |
| 摘 要： | 带时间窗的团队定向问题是一类重要的物流配送路径优化问题,其优化目标是制定最优可行车辆路线,在规定的时间窗内服务一组顾客,以获得最大的总收益。提出了一类改进蚁群算法,用以求解该问题。为了提高解构造质量与效率,使用一种快速的方法来确定动态候选链表,并且利用串行法和贪婪法构造解。与迭代局部搜索相比,所提算法能够在12s内得到更好的解。
|
| 关 键 词： | 启发式算法 团队定向问题 蚁群优化 时间窗 |
Improved Ant Colony Optimization Approach for the Team Orienteering Problem with Time Windows |
| |
| KE Liang-jun , Zhang He , SHANG Ke , FENG Zu-ren. Improved Ant Colony Optimization Approach for the Team Orienteering Problem with Time Windows[J]. Computer Science, 2012, 39(4): 214-216 |
| |
| Authors: | KE Liang-jun Zhang He SHANG Ke FENG Zu-ren |
| |
| Affiliation: | (State Key Laboratory for Manufacturing Systems Engineering,Xi’an Jiaotong University,Xi’an 710049,China) |
| |
| Abstract: | Team orienteering problem with time windows is one of the most important logistic distribution routing opti-mization problems. The optimization objective of this problem is to plan the optimal feasible routes in which the total re-ward is maximized while a set of customers can be served in the given time windows. An improved ant colony optimiza-lion approach was developed to deal with this problem. In order to construct better and faster solutions, the proposed al-gorithm uses a fast method to determine dynamic candidate list. Moreover, it adopts the sequence method and the greedymethod to construct solutions. Compared with iterated local search, the proposed algorithm can obtain better resultswithin 12 seconds. |
| |
| Keywords: | Heuristic algorithm Team orienteering problem Ant colony optimization Time windows |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
点击此处可从《计算机科学》下载全文 |
|
