Please use this identifier to cite or link to this item:
|Title:||Shortest path problem with cache dependent path lengths||Authors:||Fu, Z.
|Issue Date:||2003||Citation:||Fu, Z., Kurnia, A., Lim, A., Rodrigues, B. (2003). Shortest path problem with cache dependent path lengths. 2003 Congress on Evolutionary Computation, CEC 2003 - Proceedings 4 : 2756-2761. ScholarBank@NUS Repository. https://doi.org/10.1109/CEC.2003.1299437||Abstract:||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. © 2003 IEEE.||Source Title:||2003 Congress on Evolutionary Computation, CEC 2003 - Proceedings||URI:||http://scholarbank.nus.edu.sg/handle/10635/130485||DOI:||10.1109/CEC.2003.1299437|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 5, 2022
checked on Dec 1, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.