Solving the constrained shortest path problem
using random search strategy
佚名
【期刊名称】《中国科学》 【年(卷),期】2010(000)012
【摘要】In this paper, we propose an improved walk search strategy to solve the constrained shortest path problem. The proposed search strategy is a local search algorithm which explores a network by walker navigating through the network. In order to analyze and evaluate the proposed search strategy, we present the results of three computational studies in which the proposed search algorithm is tested. Moreover, we compare the proposed algorithm with the ant colony algorithm and k shortest paths algorithm. The analysis and comparison results demonstrate that the proposed algorithm is an effective tool for solving the constrained shortest path problem. It can not only be used to solve the optimization problem on a larger network, but also is superior to the ant colony algorithm in terms of the solution time and optimal paths.
【总页数】6页(P.3258-3263) 【
关
键
词
】
constrained;shortest;path;deterministic;random;walk;optimization 【作者】佚名
Solving the constrained shortest path problem using random search strategy
