摘要
专用道设置问题中,将运输任务限定为一个,从而将问题转化为带约束条件的动态最短路径问题。针对该问题的实际特点,设计了生枝-剪枝算法。该算法的核心思想是:穷举所有从起点开始的行驶路径(生枝过程),然后利用剪枝规则剪除不符要求的分枝,最后在抵达终点的行驶路径中经过比较选出最优路径。
If there is only one transport task in the Lane-reserved Problems, the new problem named Dynamic Shortest Path Problem with Constraints（DSPC） is studied in this paper. From the factual characteristic of DSPC, Create-and-Cut algorithm is introduced. The algorithm is a brute-force algorithm, that is, creating travel-paths（branches） from Source-node for every node in transportation network, cutting undesirable branches by Cutting-Rules, comparing and picking out the optimal travel-path within all travel-paths which arrived at the destination-node.
出处
《湖南工业职业技术学院学报》
2014年第5期9-11,共3页
Journal of Hunan Industry Polytechnic
