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
来源：
CEC: 2003 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-4, PROCEEDINGS | 2003年
关键词：
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 条
12345