1. Dijkstra, E.W., “A Note on Two Problems in
Connection with Graphs”, Numerische
Mathematik, Vol 1, 269–271, 1959.
2. Dantzig, G.B., “On the Shortest Route Through a
Network”, Management Science, 187–190, 1960.
3. Floyd, R.W., “Algorithm 97: Shortest Path”,
Communications of the ACM 5, 1962.
4. Beasley, D., Bull, D.R., and Martin, R.R., 1993a.
“An Overview of Genetic Algorithms: Part 1”,
Fundamentals. University Computing, Vol
15(2), 58–69, UK, 1993.
5. Beasley, D., Bull, D.R., and Martin, R.R., 1993b.
“An Overview of Genetic Algorithms: Part 2”,
Research Topics University Computing, Vol
15(4), 170–181, UK, 1993.
6. Bingul, Z., Sekmen, A.S. and Zein, S., “An
Application of Multi-Dimensional Optimization
Problems Using Genetic Algorithms”,
Proceedings of the IASTED International
Conference Intelligent Systems and Control,
Santa Barbara, CA, USA, 1999.
7. Bingul, Z., Sekmen, A.S. and Zein, S., “Genetic
Algorithms Applied to Real Time Multi-objective
Optimization Problems”, IEEE SoutheastCon
2000 Conference, Nashville, TN, USA, 2000.
8. Drezner, Z. and Wesolowsky, G.O., “Network
Design: Selection and Design of Links and
Facility Location”, Transportation Research
Part A: Policy and Practice, Vol 37, No 3, 241–
256, 2003.
9. Xiaoyu J., “Models and Algorithm for Stochastic
Shortest Path Problem”, Applied Mathematics
and Computation, Vol 170, No 1, 503–514,
2005.
10. Daniele C., Martine L., Martha Salazar N.,
“Reduction Approaches for Robust Shortest Path
Problems”, Computers &Operations Research,
Vol 38, No 11, 1610–1619, 2011.
11. Bellman, E., “On a Routing Problem”, Appl.
Math., Vol 16, 87–90, 1958.
12. Dijkstra, E.W., “A Note on Two Problems in
Connection with Graphs”, Numer. Math. 1, Vol
1, 269–271, 1959.
13. Dreyfus, S., “An Appraisal of Some Shortest Path
Algorithms”, Oper. Res., Vol 17, No 3, 395–412,
1969.
14. Wook, C., Ramakrishna, R.S., “A Genetic
Algorithm for Shortest Path Routing Problem and
the Sizing of Populations”, IEEE Transactions
on Evolutionary Computation, Vol 6, No 6,
2002.
15. Munemoto, M., Takai, Y., Sato, Y., “A Migration
Scheme for the Genetic Adaptive Routing
Tablo 5. Algoritmaların çalışma süreleri (Processing time for the algorithms)
Atlama
Sayısı Yollar
Wook’un
algoritması için
süre (s)
Dijkstra
algoritması için
süre (s)
Önerilen
algoritma için
süre (s)
1 V39 – V37 0,9 1,1 0,6
2 V37 – V36 0,7 0,9 0,5
3 V36 – V35 0,7 0,8 0,4
4 V35 – V34 0,7
V35 – V11 0,9 0,4
5 V34 – V31 0,5
V11 – V10 0,6 0,3
0,5
6 0,7
V31 – V9
V10 – V9
V10 – V8 0,4
7 V9 – V2 0,5 0,7
V8 – V3 0,3
8 V2 – V1 0,5 0,6
V3 – V1 0,3
Toplam Süre 5,0 6,3 3,2
M. Dener ve Ark. Zamana Bağlı Dinamik En Kısa Yol Problemi İçin…
928 Gazi Üniv. Müh. Mim. Fak. Der. Cilt 26, No 4, 2011
Algorithm,” IEEE Int. Conf. Systems, Man, and
Cybernetics, 2774–2779, 1998.
16. Inagaki, J., Haseyama, M., Kitajima, H., “A
Genetic Algorithm for Determining Multiple
Routes and Its Applications,” IEEE Int. Symp.
Circuits and Systems, 137–140, 1999.
17. Liu, W., Wang, L.P., “Solving the Shortest Path
Routing Problem Using Noisy Hopfield Neural
Networks”, WRI International Conference on
Communications and Mobile Computing:
CMC 2009, Vol 2, 299-302, 2009.
18. Gen, M., Lin, L., “A New Approach for Shortest
Path Routing Problem by Random Key-Based
GA”, Gecco 2006: Genetic and Evolutionary
Computation Conference, Vol 1 and 2 , 1411–
1412, 2006.
19. Lin, L., Gen, M., Cheng, R.W.,” Priority-Based
Genetic Algorithm for Shortest Path Routing
Problem in OSPF”, Proceedings of the Third
International Conference on Information and
Management Sciences, Vol 3, 411–418, 2004.
20. Current, J.R., Velle, C.S.R., Cohon, J.L., “The
Maximum Covering/Shortest Path Problem: A
Multiobjective Network Design and Routing
Formulation”, European Journal of Operational
Research, Vol 21(2), 189–199, 1985.
21. Chabrier, A., “Vehicle Routing Problem with
Elementary Shortest Path Based Column
Generation”, Computers & Operations
Research, Vol 33(10), 2972–2990, 2006.
22. Misra, S., Oommen, B.J., “Dynamic Algorithms
for the Shortest Path Routing Problem: Learning
Automata-Based Solutions”, IEEE Transactions
On Systems Man and Cybernetics Part BCybernetics,
Vol 35(6), 1179–1192, 2005.
23. Cai, X., T. Kloks, C.K. Wong, “Time-Varying
Shortest Path Problems with Constraints”,
Networks, Vol 29, No 3, 141-150, 1997.
24. Orda, A., R. Rom., “Minimum Weight Paths in
Time-Dependent Networks”, Networks, Vol 21,
295–319, 1991.
25. Halpern, J., “Shortest Route with Time Dependent
Length of Edges and Limited Delay Possibilities
in Nodes”, Mathematical Methods of
Operations Research, Vol 21, No 3, 117–124,
1977.
26. Cooke, K.L., Halsey E., “The Shortest Route
Through a Network with Time-Dependent
Internodal Transit Times”, Journal of
Mathematical Analysis and Applications, Vol
14, No 3, 493–498, 1966.
Thank you for copying data from http://www.arastirmax.com
