| CARP问题的构造型启发式算法研究 |
| |
| 引用本文： | 李庆华,林丹. CARP问题的构造型启发式算法研究[J]. 河南师范大学学报(自然科学版), 2011, 39(3): 148-152 |
| |
| 作者姓名： | 李庆华 林丹 |
| |
| 作者单位： | 天津大学,理学院,天津300072 |
| |
| 摘 要： | 全面综述了国内外用于求解容量约束弧路径问题(CARP问题)的构造型启发式算法的研究现状,指出了构造型启发式算法与元启发式算法相比而言的优点所在.将求解算法分为3类并且分别进行简要介绍,最后展望了构造型启发式算法的研究前景.
|
| 关 键 词： | CARP问题 构造型启发式算法 综述 |
Constructive Heuristic Algorithms for the CARP Problem |
| |
| LI Qing-hua,LIN Dan. Constructive Heuristic Algorithms for the CARP Problem[J]. Journal of Henan Normal University(Natural Science), 2011, 39(3): 148-152 |
| |
| Authors: | LI Qing-hua LIN Dan |
| |
| Affiliation: | (School of Sciences,Tianjin University,Tianjin 300072,China) |
| |
| Abstract: | The constructive heuristic algorithms of the capacitated arc routing problems(CARP problem) comprehensively in research status at home and abroad.This paper points out the advantages of the constructive heuristic algorithms in comparison with the meta-heuristic.These algorithms are divided into three categories and are briefly introduced.Eventually,it is the looking forward to the prospects of constructive heuristic algorithms. |
| |
| Keywords: | Capacitated Arc Routing Problem constructive heuristic algorithms review |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
