Shortest path problem with cache dependent path lengths

2003 Congress on Evolutionary Computation, CEC 2003 - Proceedings

Volumn 4, Issue , 2003, Pages 2756-2761

  Fu, Z ^a   Kurnia, A ^a   Lim, A ^b   Rodrigues, B ^c  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^c SINGAPORE MANAGEMENT UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; TABU SEARCH;

CACHE SIZE; DIJKSTRA; NP COMPLETE; PATH LENGTH; SHORTEST PATH; SHORTEST PATH PROBLEM;

GRAPH THEORY;

EID: 34548750176     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2003.1299437     Document Type: Conference Paper

References (16)

1. Dijkstra, E. W., A note on two paper in connection with graphs, Numerische Mathematik 1(1959), pp. 269-271
2. Finding the k-shortest paths, SIAM Journal of Computing 28(2) (1998), pp. 653-674
3. Floyd, R. W., Algorithm 97: Shortest paths, Communications of ACM, 5 (1962) 345
4. Cai, X., Klocks, T., Wong C. K., Time-varying shortest path algorithms with constraints, Networks 29 (3) (1997) pp. 141-149
5. Genetic Algorithms for rerouting shortest paths in dynamic and stochastic networks, European Journal of Operational Research, 144 (2003) pp. 27-38
6. Avella, P., Boccia, M., Sforza, A., A penalty function heuristic for the resource constrained shortest path problem, European Journal of Operational Research 142 (2002) pp. 221-230
7. Almeida, V., Bestavros, A., Crovella, M., and De Oliveira, A., Characterizing Reference Locality in the WWW. In Proceedings of the IEEE Conference on Parallel and Distributed Information Systems, (1996)
8. Cunha, C. R., and Jaccoud, C. F. B., Determining WWW User's Next Access and Its Applications to Pre-fetching, In International Symposium on Computers and Communications 97, (1997)
9. Bestavros, A., Using Speculation to Reduce Server Load and Service Time on WWW, In Proceedings of The 4th ACM International Conference on Information and Knowledge Management, (1995).
10. Garey, M. R., and Johnson, D. S., Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, (1979).
11. Goldberg, D. E., Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading, Massachusetts, (1989).
12. Gen, M., Cheng, R., Wang, D., Genetic algorithms for solving shortest path problems, In Proceedings of 1997 IEEE International Conference on Evolutionary Computing, (1997) pp. 401-406
13. Frank, H., Shortest paths in probabilistic graphs, Operations Research, 17 (1968) pp. 583-599
14. Mirchandani, P. B., Shortest distance reliability of probabilistic computer networks, Operations Research, (1976) pp. 347-356
15. Kirkpatrick, S., Gelatt CD. Jr. and Vecchi, M. P., Optimization by Simulated Annealing, Science, (1983), 220:671-680
16. Glover, F., Tabu Search - Part II. ORSA Journal on Computing, (1993), 2:4-32