Finding the Shortest Paths Among Cities in Java Island Using Node Combination Based on Dijkstra Algorithm

[1]. X. Zhang, Y. Zhang, “Rapid Physarum, Algorithm ForShortest Path Problem”, Applied Soft Computing Vol. 23,pp.19–26, Oktober2014.10.1016/j.asoc.2014.05.032 Search in Google Scholar

[2]. M. Farhanchi, R. Hassanzadeh, “A Modified Ant Colony System For Finding The Expected Shortest Path In Networks With Variable Arc Lengths And Probabilistic Nodes”, Applied Soft Computing Vol. 21,pp. 491–500, August 2014.10.1016/j.asoc.2014.03.020 Search in Google Scholar

[3]. F. W. Trevizan, M. M. Veloso, “Depth-Based Short-Sighted Stochastic Shortest Path Problems”, Artificial Intelligence, 216,pp. 179–205, 2014.10.1016/j.artint.2014.07.001 Search in Google Scholar

[4]. J. DeCarufel, C. Grimm, “A Note On The Unsolvability Of The Weighted Region Shortest Path Problem”, Computational Geometry, Vol. 47, issue 7, pp. 724–727, August 2014.10.1016/j.comgeo.2014.02.004 Search in Google Scholar

[5]. A. K. Ziliaskopoulos, F. D. Mandanas, “An Extension Of Labeling Techniques For Finding Shortest Path Trees”, European Journal of Operational Research, Vol. 198, issue 1,pp.63– 72, October 2009.10.1016/j.ejor.2008.08.018 Search in Google Scholar

[6]. C. Gao, C. Yan, “An Amoeboid Algorithm For Solving Linear Transportation Problem”, Physica A: Statistical Mechanics and its Applications, Vol. 398, pp. 179–186, March 2014.10.1016/j.physa.2013.12.023 Search in Google Scholar

[7]. E. Amaldi, A. Capone, “Energy-Aware IP Traffic Engineering With Shortest Path Routing”, Computer Networks, Vol. 57, issue 6, pp. 1503–1517, April 2013. Search in Google Scholar

[8]. Y. Zhang, Z. Zhang, “A Biologically Inspired Solution For Fuzzy Shortest Path Problems”, Applied Soft Computing,Vol. 13, Issue 5, pp. 2356–2363, May 2013.[9]. A. Nazemi, F. Omidi, “An Efficient Dynamic Model For Solving The Shortest Path Problem”, Transportation Research Part C: Emerging Technologies, Vol.26,pp.1–19, January 2013. Search in Google Scholar

[0]. W. Peng, X. Hu, “A Fast Algorithm to Find All-Pairs Shortest Paths in Complex Networks”, Procedia Computer Science, Vol. 9, pp. 557 – 566, 2012.10.1016/j.procs.2012.04.060 Search in Google Scholar

[1]. R. Hassanzadeh, I. Mahdavi, “A Genetic Algorithm For Solving Fuzzy Shortest Path Problems With Mixed Fuzzy Arc Lengths”, Mathematical and Computer Modelling, Vol. 57, Issue 1-2, pp. 84 – 99, January 2013.10.1016/j.mcm.2011.03.040 Search in Google Scholar

[2]. W. Shu-Xi,”The Improved Dijkstra’s Shortest Path Algorithm and Its Application”, Procedia Engineering, Vol. 29, pp. 1186 – 1190, 2012. Search in Google Scholar

[3]. S. Subramanian, R. Tamassia, “An Efficient Parallel Algorithm for Shortest Paths inPlanar Layered Digraphs”, Algorithmica, Vol. 14, Issue 4, pp. 322-339, October 1995.10.1007/BF01294130 Search in Google Scholar

[4]. J. Joaci, A. R. Backes, “Texture Analysis And Classification Using Shortest Paths In Graphs”, Pattern Recognition Letters, Vol. 34, Issue 11, pp. 1314–1319, August 2013. Search in Google Scholar

[5]. J. Quan Li, “Match Bus Stops To A Digital Road Network By The Shortest Path Model”, Transportation Research Part C: Emerging Technologies, Vol. 22, pp. 119–131, June 2012.10.1016/j.trc.2012.01.002 Search in Google Scholar

[6]. C. Bode, S. Irnich, “The Shortest-Path Problem With Resource Constraints With (K,2) – Loop Elimination And Its Application To The Capacitated Arc-Routing Problem”, European Journal of Operational Research, Vol. 238, Issue 2, pp. 415–426, October 2014.10.1016/j.ejor.2014.04.004 Search in Google Scholar

[7]. F. J. Pulido, L. Mandow, “MultiobjectiveShortest Path Problems With Lexicographic Goal- BasedPreferences”, European Journal of Operational Research, Vol. 239, Issue 1, pp. 89– 101, November 2014.10.1016/j.ejor.2014.05.008 Search in Google Scholar

[8]. Y. Xi, L. Schwiebert, “Privacy Preserving Shortest Path Routing With An Applicationto Navigation”, Pervasive and Mobile Computing, Vol. 13, pp. 142–149, August 2014.10.1016/j.pmcj.2013.06.002 Search in Google Scholar

[9]. C. L. Azevedo, J. L. Cardoso, “Vehicle Tracking Using The K-Shortest Paths Algorithm And DualGraphs”, Transportation Research Procedia, Vol. 1, Issue 1, pp. 3 – 11, 2014.10.1016/j.trpro.2014.07.002 Search in Google Scholar

[0]. M. Baxter, T. Elgindy, “Incremental Network Design With Shortest Paths”, European Journal of Operational Research, Vol. 238, Issue 3, pp. 675–684, November 2014.10.1016/j.ejor.2014.04.018 Search in Google Scholar

[1]. L. Sitanayah, K. N. Brown, “A Fault-Tolerant Relay Placement Algorithm For Ensuring Kvertex-Disjoint Shortest Paths In Wireless Sensor Networks”, Ad Hoc Networks, Vol. 23, pp. 145–162, December 2014.10.1016/j.adhoc.2014.07.003 Search in Google Scholar

[2]. B. Doerr, D. Johannsen, “More Effective Crossover Operators For The All-Pairs Shortest Path Problem”, Theoretical Computer Science, Vol. 471, pp. 12–26, February 2013.10.1016/j.tcs.2012.10.059 Search in Google Scholar

[3]. F. Chu, S. Chen, “Optimal Design Of Pipeline Based On The Shortest Path”, Physics Procedia, Vol. 33, pp. 216 – 220, 2012.10.1016/j.phpro.2012.05.054 Search in Google Scholar

[4]. X. Lu, M. Camitz, “Finding The Shortest Paths By Node Combination”,Applied Mathematics and Computation, Vol. 217,Issue 13, pp. 6401–6408, March 2011. Search in Google Scholar

[5]G. Yu, H.Song, “Unmanned Aerial Vehicle Path Planning Based On TLBO Algorithm”, International Journal On Smart Sensing And Intelligent Systems, Vol. 7, No. 3, pp. 1310 – 1325, September 2014. Search in Google Scholar

[6]Z. Cui, Y. Zhao, “An Energy-Efficient Routing For Vehicular Ad Hoc Networks Using Real-Time Perception Of Node Information” International Journal On Smart Sensing And Intelligent Systems Vol. 8, No. 2, pp. 1142– 1161, January 2015. Search in Google Scholar

[7]C. J. Zhu, K.Y Lam, “Approximate Path Searching For Supporting Shortest Path Queries On Road Networks”, Information Science, Vol. 325, pp. 409-428, December 2015.10.1016/j.ins.2015.06.045 Search in Google Scholar

[8]F.J. Pulido, L. Mandow, “Dimensionality Reduction In Multiobjective Shortest Path Search”, Computers & Operations Research, Vol. 64, pp. 60-70, December 2015.10.1016/j.cor.2015.05.007 Search in Google Scholar