Shortest path problem with cache dependent path lengths

被引:0
|
作者
Fu, Z [1 ]
Kurnia, A [1 ]
Lim, A [1 ]
Rodrigues, B [1 ]
机构
[1] Natl Univ Singapore, Dept Comp Sci, Singapore 117543, Singapore
关键词
shortest path problem; cache; tabu search; Genetic Algorithms; webpages;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
In this paper, we are motivated by the problem of finding the shortest path in a network when traversing webpages where cache size determines path length. The Shortest Path Problem with Cache-dependent Path Lengths is shown to be NP-Complete. It is a new problem for which we propose several effective heuristics, including a Dijkstra heuristic, Genetic Algorithms and Tabu Search.
引用
收藏
页码:2756 / 2761
页数:6
相关论文
共 50 条
  • [21] On shortest path problems with "non-Markovian" link contribution to path lengths
    Sen, A
    Candan, KS
    Ferreira, A
    Beauquier, B
    Perennes, S
    NETWORKING 2000, 2000, 1815 : 859 - 870
  • [22] A Faster Cache-Oblivious Shortest-Path Algorithm for Undirected Graphs with Bounded Edge Lengths
    Allulli, Luca
    Lichodzijewski, Peter
    Zeh, Norbert
    PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2007, : 910 - 919
  • [23] Refreshment of the shortest path cache with change of single edge
    Li, Xiaohua
    Qiu, Tao
    Wang, Ning
    Yang, Xiaochun
    Wang, Bin
    Yu, Ge
    EXPERT SYSTEMS WITH APPLICATIONS, 2017, 67 : 1 - 11
  • [24] Improving the Cache-Efficiency of Shortest Path Search
    Edelkamp, Stefan
    KI 2017: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2017, 10505 : 99 - 113
  • [25] A faster algorithm for the single source shortest path problem with few distinct positive lengths
    Orlin, James B.
    Madduri, Kamesh
    Subramani, K.
    Williamson, M.
    JOURNAL OF DISCRETE ALGORITHMS, 2010, 8 (02) : 189 - 198
  • [26] Complexity of Some Inverse Shortest Path Lengths Problems
    Cui, Tingting
    Hochbaum, Dorit S.
    NETWORKS, 2010, 56 (01) : 20 - 29
  • [27] An extension principle based solution approach for shortest path problem with fuzzy arc lengths
    Niroomand, Sadegh
    Mahmoodirad, Ali
    Heydari, Ahmad
    Kardani, Fatemeh
    Hadi-Vencheh, Abdollah
    OPERATIONAL RESEARCH, 2017, 17 (02) : 395 - 411
  • [28] DENSITIES OF SHORTEST PATH LENGTHS IN SPATIAL STOCHASTIC NETWORKS
    Voss, Florian
    Gloaguen, Catherine
    Fleischer, Frank
    Schmidt, Volker
    STOCHASTIC MODELS, 2011, 27 (01) : 141 - 167
  • [30] An extension principle based solution approach for shortest path problem with fuzzy arc lengths
    Sadegh Niroomand
    Ali Mahmoodirad
    Ahmad Heydari
    Fatemeh Kardani
    Abdollah Hadi-Vencheh
    Operational Research, 2017, 17 : 395 - 411