Solving the constrained shortest path problem using random search strategy

被引：2
|
作者：
Li KePing [1 ]
Gao ZiYou [1 ]
Tang Tao [1 ]
Yang LiXing [1 ]
机构：
[1] Beijing Jiaotong Univ, State Key Lab Rail Traff Control & Safety, Beijing 100044, Peoples R China
来源：
SCIENCE CHINA-TECHNOLOGICAL SCIENCES | 2010年 / 53卷 / 12期
基金：
中国国家自然科学基金;
关键词：
constrained shortest path; deterministic random walk; optimization; ALGORITHMS; WALK;
D O I：
10.1007/s11431-010-4105-2
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
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.
引用
收藏
页码：3258 / 3263
页数：6
相关论文
共 50 条
  • [1] Solving the constrained shortest path problem using random search strategy
    LI KePing GAO ZiYou TANG Tao YANG LiXing State Key Laboratory of Rail Traffic Control and Safety Beijing Jiaotong University Beijing China
    Science China(Technological Sciences), 2010, 53 (12) : 3258 - 3263
  • [2] Solving the constrained shortest path problem using random search strategy
    LI KePing
    Science China(Technological Sciences), 2010, (12) : 3258 - 3263
  • [3] Solving the constrained shortest path problem using random search strategy
    KePing Li
    ZiYou Gao
    Tao Tang
    LiXing Yang
    Science China Technological Sciences, 2010, 53 : 3258 - 3263
  • [4] Solving the shortest path problem in an imprecise and random environment
    V P Singh
    Kirti Sharma
    Debjani Chakraborty
    Sādhanā, 2020, 45
  • [5] Solving the shortest path problem in an imprecise and random environment
    Singh, V. P.
    Sharma, Kirti
    Chakraborty, Debjani
    SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 2020, 45 (01):
  • [6] CONSTRAINED SHORTEST PATH PROBLEM
    ANEJA, YP
    NAIR, KPK
    NAVAL RESEARCH LOGISTICS, 1978, 25 (03) : 549 - 555
  • [7] A gene-constrained genetic algorithm for solving shortest path problem
    Wu, W
    Ruan, QQ
    2004 7TH INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING PROCEEDINGS, VOLS 1-3, 2004, : 2510 - 2513
  • [8] BDD-Constrained A* Search: A Fast Method for Solving Constrained Shortest-Path Problems
    Takeuchi, Fumito
    Nishino, Masaaki
    Yasuda, Norihito
    Akiba, Takuya
    Minato, Shin-ichi
    Nagata, Masaaki
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2017, E100D (12): : 2945 - 2952
  • [9] Solving the shortest path problem using an analog network
    Bu, Linkai
    Chiueh, Tzi-Dar
    IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, 1999, 46 (11): : 1360 - 1363
  • [10] Solving the shortest path problem using an analog network
    Bu, LK
    Chiueh, TD
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 1999, 46 (11) : 1360 - 1363
12345