RP问题的元启发式算法综述
Research on metaheuristic algorithms for CARP problem
本文全面综述了国内外用于求解容量约束弧路径问题（CARP问题）及其变异形式的各种元启发式算法的研究现状，指出了元启发式算法的优点所在。按照CARP问题的类型对求解算法分别进行了全面比较介绍，最后展望了元启发式算法的研究前景。
his paper describes the meta-heuristic algorithms of the capacitated arc routing problem (CARP problem) comprehensively in the current research status. This paper points out the advantages of the meta-heuristic algorithms in comparison with the constructive heuristic. These algorithms are briefly introduced and compared according to the classifications of CARP. The prospects of meta-heuristic algorithms are presented in the last section.
李庆华、李波
计算技术、计算机技术
容量约束弧路径问题元启发式方法编码方式解的质量运行时间
apacitated Arc Routing Problemmeta-heuristic algorithmscoding methodssolution qualityrunning times
李庆华,李波.RP问题的元启发式算法综述[EB/OL].(2013-12-31)[2025-08-11].http://www.paper.edu.cn/releasepaper/content/201312-1253.点此复制
评论