Shortest Path Problem with Cache-Dependent Path Lengths
Conference Proceeding Article
Here, we are motivated by the problem of finding the shortest path in a network when traversing Web pages 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.
Operations and Supply Chain Management
CEC 2003: 2003 Congress on Evolutionary Computation: Proceedings: Canberra, Australia, 8-12 December 2003
City or Country
FU, Z.; Kurnia, A.; LIM, Andrew; and RODRIGUES, Brian.
Shortest Path Problem with Cache-Dependent Path Lengths. (2003). CEC 2003: 2003 Congress on Evolutionary Computation: Proceedings: Canberra, Australia, 8-12 December 2003. 4, 2756-2761. Research Collection Lee Kong Chian School Of Business.
Available at: http://ink.library.smu.edu.sg/lkcsb_research/2064