Shortest Path Trajectory System Based on Dijkstra Algorithm

Shortest Path Trajectory System Based on Dijkstra Algorithm

In the master project, the researcher discussed the shortest path solution to a single source problem based on Dijkstra algorithm as resolving the basic concepts. Everybody can travel by different routes to reach a different destination point. This can be time consuming if they do not travel trough...

Full description

Saved in:
Bibliographic Details
Main Author: Putri, Indah Pratiwi
Format: Thesis
Language:eng
eng
Published: 2012
Subjects:
QA75 Electronic computers
Computer science
Online Access:https://etd.uum.edu.my/3306/1/INDAH_PRATIWI_PUTRI.pdf
https://etd.uum.edu.my/3306/4/INDAH_PRATIWI_PUTRI.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
id my-uum-etd.3306
record_format uketd_dc
institution Universiti Utara Malaysia
collection UUM ETD
language eng
eng
advisor Ku-Mahamud, Ku Ruhana
topic QA75 Electronic computers
Computer science
spellingShingle QA75 Electronic computers
Computer science
Putri, Indah Pratiwi
Shortest Path Trajectory System Based on Dijkstra Algorithm
description In the master project, the researcher discussed the shortest path solution to a single source problem based on Dijkstra algorithm as resolving the basic concepts. Everybody can travel by different routes to reach a different destination point. This can be time consuming if they do not travel trough the best route. This project aims to determine locations of the node that reflect all the items in the list, build the route by connecting nodes and evaluate the proposed algorithm for the single source shortest path problem. This project includes the modification of main algorithm which has been implemented in the prototype development. This study discussed the emphasis on the single source shortest path at the location of specific studies. The study will produce a decision-makers prototype.
format Thesis
qualification_name masters
qualification_level Master's degree
author Putri, Indah Pratiwi
author_facet Putri, Indah Pratiwi
author_sort Putri, Indah Pratiwi
title Shortest Path Trajectory System Based on Dijkstra Algorithm
title_short Shortest Path Trajectory System Based on Dijkstra Algorithm
title_full Shortest Path Trajectory System Based on Dijkstra Algorithm
title_fullStr Shortest Path Trajectory System Based on Dijkstra Algorithm
title_full_unstemmed Shortest Path Trajectory System Based on Dijkstra Algorithm
title_sort shortest path trajectory system based on dijkstra algorithm
granting_institution Universiti Utara Malaysia
granting_department Awang Had Salleh Graduate School of Arts & Sciences
publishDate 2012
url https://etd.uum.edu.my/3306/1/INDAH_PRATIWI_PUTRI.pdf
https://etd.uum.edu.my/3306/4/INDAH_PRATIWI_PUTRI.pdf
_version_ 1747827543245848576
spelling my-uum-etd.33062019-11-13T02:54:06Z Shortest Path Trajectory System Based on Dijkstra Algorithm 2012 Putri, Indah Pratiwi Ku-Mahamud, Ku Ruhana Awang Had Salleh Graduate School of Arts & Sciences Awang Had Salleh Graduate School of Arts & Sciences QA75 Electronic computers. Computer science In the master project, the researcher discussed the shortest path solution to a single source problem based on Dijkstra algorithm as resolving the basic concepts. Everybody can travel by different routes to reach a different destination point. This can be time consuming if they do not travel trough the best route. This project aims to determine locations of the node that reflect all the items in the list, build the route by connecting nodes and evaluate the proposed algorithm for the single source shortest path problem. This project includes the modification of main algorithm which has been implemented in the prototype development. This study discussed the emphasis on the single source shortest path at the location of specific studies. The study will produce a decision-makers prototype. 2012 Thesis https://etd.uum.edu.my/3306/ https://etd.uum.edu.my/3306/1/INDAH_PRATIWI_PUTRI.pdf text eng validuser https://etd.uum.edu.my/3306/4/INDAH_PRATIWI_PUTRI.pdf text eng public http://sierra.uum.edu.my/record=b1241357~S1 masters masters Universiti Utara Malaysia Y.Chao & W.Hongxia, "Developed Dijkstra Shortest Path Search Algorithm and Simulation," International Conference on Computer Design and Applications, vol. 1, pp. 116-119, 2010. T.Terada, M.Miyamae, Y.Kishino, K.Tanaka, S.Nishio, T.Nakagawa, & Y.Yamaguchi, "Design Of A Car Navigation System That Predicts User Destination," in MDM '06: Proceedings of the 7th International Conference on Mobile Data Management, Washington, DC, USA: IEEE Computer Society, pp. 145, 2006. J.Froehlich & J.Krumm, "Route Prediction From Trip Observations," in Intelligent Vehicle Initiative (IVI) Technology Advanced Controls and Navigation Systems, SAE World Congress & Exhibition, Detroit, Michigan, USA, 2008. A.Monreale, F.Pinelli, R.Trasarti, & F.Giannoti, "Wherenext: A Location Predictor on Trajectory Pattern Mining," in MLDM '07: Proceedings of the 5th international conference on Machine Learning & Data Mining in Pattern Recognition, 2009. N.Edmonds, A.Breuer, D.Gregor, & A.Lumsdaine, "Single-Source Shortest Paths with the Parallel Boost Graph Library," ed. Bloomington: Indiana University, 2007, pp.1-20 G.D.Lorenzo, F.Pinelli, F.C.Pereira, A.Biderman, C.Ratti, C.Lee, & C.Lee, "An Affective Intelligent Driving Agent: Driver's Trajectory & Activities Prediction, Institute of Electrical & Electronics Engineers," in Vehicular Technology Conference Fall ed. Massachusetts: Massachusetts Institute of Technology, 2009. D.A. Marcus, Graph Theory: A Problem Oriented Approach. USA: MAA Textbook, 2008. N.Dale, D.T.Joyce, & C.Weems, Object Oriented Data Structures using Java. Massachusetts: Jones & Bartlett,2002. C.B.Gupta, S.R.Singh, & S.Kumar, Advance Discrete Structure: I.K. International Publishing House Pvt., Limited, 2010. S.B.Gupta, Comprehensive Discrete Mathematics & Structures. New Delhi: Laxmi Publications, 2006. G.Singh, Visual Basic 6. India: Laxmi Publications Pvt Ltd, 2007. Y.Dou, H.Guo, & J.Zhou, "A New Approach for the Shortest Path Problem with Vague Sets" International Symposium on Computational Intelligence & Design, p.4, 2008. R.Johnsonbaugh, Discrete Mathematics. USA: Pearson, 2009. J.-X.Xiao & F.-L.Lu, "An Improvement of the Shortest Path Algorithm Based on Dijkstra Algorithm," IEEE, vol. 2, p. 3, 2010. W.Shu-Xi & Z.Xing-Qiu, "The Improved Dijkstra's Shortest Path Algorithm" p.4, 2011. K.H.Rosen, Discrete Structure & Its Application. Singapore: McGraw Hill, 2007. Y.Li, Z.Nie, & X.Zhou, "Finding the Optimal Shortest Path Tree with Respect to Single Link Failure Recovery," Fourth International Conference on Networked Computing & Advanced Information Management, p.4, 2008. R.Lafore, Data Structures & Algorithms in Java. Indianapolis: SAMS, 2003. L.Xia-Miao, T.Jie, & Q.Ming-ming, "Computing Shortest Path Problem with Subtractive Weight Based on Tableau Method," IEEE, pp.4299, 3, 2007. C.GlaBer, C.ReitwieBner & M.Witek, "Improved & Generalized Approximations for Two-Objective Traveling Salesman" Electronic Colloquium on Computational Complexity, p.32, 2010. T.Feyessa, M.Bikdash, & G.Lebby, "Node-pair Feature Extraction for Link Prediction," IEEE International Conference on Privacy, Security, Risk, & Trust, p.4, 2011. W.Jigang, P.Han, G.R.Jagadeesh, & T.Srikanthan, "Practical Algorithm for Shortest Path on Large Networks with Time-dependent Edge-Length," p.4, 2010. J.B. Orlin, K. Madduri, K. Subramani, & M. Williamson, "A Faster Algorithm For The Single Source Shortest Path Problem With Few Distinct Positive Lengths," Elsevier Journal of Discrete Algorithms, vol.8, no.2, pp.189-198, 2010. Q.Peng, Y.Yu, & W.Wei, "The Shortest Path Parallel Algorithm on Single Source Weighted Multi-Level Graph," Second International Workshop on Computer Science & Engineering, p.4, 2009. C.-S.Chiu, "A Genetic Algorithm for Multi-objective Path Optimization Problem" International Conference on Natural Computation, p.6, 2010. S.S.W.Lee, P.-K.Tseng, & A.Chen, "Multi-Topology Design & Link Weight Assignment for Green IP Networks," IEEE, p.6, 2011. Y.Lu, X.Huo, & P.Tsiotras, "Beamlet-like Data Processing for Accelerated Path-Planning Using Multiscale Information of the Environment," IEEE Conference on Decision & Control, p.6, 2010. F.Hern&es, M.T.Lamata, J.L.Verdegey, & A.Yamakami, "The shortest path problem on networks with fuzzy parameters," p.10, 2007. W.WU & Q.Ruan, "A Hierarchical Approach for the Shortest Path Problem with Obligatory Intermediate Nodes," ICSP2006 Proceedings, p.4, 2006. H.Ishikawa, S.Shimizu, Y.Arakawa, N.Yamanaka, & K.Shiba, "New Parallel Shortest Path Searching Algorithm based on Dynamically Reconfigurable Processor DAPDNA-2," IEEE Communications Society subject matter experts for publication in the ICC, p.6, 2007. B. S. Hasan,,M. A Khamees, & A.S.H Mahmoud, A Heuristic Genetic Algorithm for the Single Source Shortest Path Problem,"IEEE, p. 8, 2007. S. Baswana, T.Friedrich, S.Biswas, P.P. Kurur, B. Doerr, & F. Neumann,"Computing Single Source Shortest Path Using-Objective Fitness Functions,"ACM International Computer Science, p. 7, 2009. Y. Li, Z.-L. Zhang,& D. Boley,"The Routing Continuum from Shortest-path to All-Path: A Unifying Theory," International Conference on Distributed Computing Systems, p. 10, 2011. S. Peyer, D. Rautenbach, & J. Vygen,"A Generalization of Dilkstra's Shortest Path Algorithm with Applications to VLSI Routing,"Intitut fur Mathematik, TU Ilmenau, 2007. L. Wang, M. Springer, H. Heibel, & N. Navab, "Floyd-Warshall All-Pair Shortest Path for Accurate Multi-Marker Calibration," IEEE International Smposium on Mixed & Augmented Reality, P.2, 2010. M. L. Fredman & R. E. Tarjan. Fibonacci heaps & their uses in improved network optimization algorithms. J. Assoc. Computer Mach., 34(3) : 596(615,1987. D. Johnson, "Efficient Algorithms For Shortest Paths In Sparse Networks," Journal of the ACM, Vol. 24, no.1, pp1-13, 1977. A. A. Puntambekar, Design & Analysis of Algorithms. Bangalore: Technical Publications, 2010. M. Y. Kao, Encyclopedia of Algorithms. Shanghai: Springer, 2008. H. Henderson, Encyclopedia of Computer Science & Technology. New York: InfoBase Publishing, 2009. M. McMillan, Data Structure & Algorithms Using C#. Cambridge: Cambridge University Press, 2007. F. Bu & H. Fang, "Shortest Path Algorithm within Dynamic Restricted Searching Area in City Emergency Rescue "Department of Engineering of Security & Protection System, p.4, 2010. W. An, F.-M. Shao, & H. Meng, "The Expected Energy Comsumption of Wireless Distributed Sensor Networks Based on Node R & om Failures,"IEEE Communications & Networking in China, p.5,2007. S. Asadi, V. Azimirad, A. Elami & A. Ghanbari,"A Novel Global Optimal Path Planning & Trajectory Method Based on Adaptive Dijkstra-Immune Approach for Mobile Robot,"IEEE, pp. 1093,6 2011. Neopoli Tan, Richard, & Kumarss Naimipour. Foundations of Algorithms Using C++ Pseudocode. Third Edit ion. Sudbury, Massachusetts: Jones & Bartl ett Publishers, 2008. Y. Hu Z Chang, L. Sun, & Y. Wang, "Analysis of the Shortest Repaired Path of Distributed Network Based on Dijkstra Algorithm, "International Conference on Energy & Environment Technology, p.4, 2009. J. Gao, J. X. Yu, H. Qiu, X.Jiang, T. Wang, & D. Yang,"Holistic Top-K Simple Shortest Path Join in Graphs, "IEEE Transactions on knowledge & Data Engineering, p.13, 2012. Y. Chao, "A Developed Dijkstra Algorithm & Simulation of Urban Path Search,"The 5th International Conference on Computer Science & Education, p.4, 2010. J. Bang-Jensen & G. Gutin, Digraphs Theory,Algorithms & Applications. Berlin: Springer-Verlag, 2007. Z. Fuhao & L. Jiping,"An Algrithm of Shortest Path Based on Dijkstra for Huge Data "Sixth International Conference on Fuzzy Systems & Knowledge Discovery, p. 4, 2009. M. Thorup. "On RAM Priority Queues, "Proceeding of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, ages 59(67, New York, 1996. ACM Press. M. Thorup. "Undirected Single-Sources Shortest Paths with Positive Integer Weights in Linear Time." Journal of the Association for Computing Machinery, 46:362(394, 1999. C. McGeoch, Design of Experiment for Computer Science & Mathematics. Amherst College, 2009. C. Dementrescu & G. F. Italiano, "Engineering Shortest Path Algorithms,"p.8, 2008. Montgomery, Douglas C., Design & Analysis of Experiments. USA: Wiley, 2008. J. Antony, Design of Experiments for Engineers & Scientists. Butterworth: Heinemann, 2003. Y. Zhang, Z. Lin, H. Zhou, & H. Wang, "A Method of Image Processing Algorithms Evaluation Based on Orthogonal Experimental Design" Fifth International Conference on Image & Graphics, p.5, 2009. S. T. Thornton, & A. Rex, Modern Physics for Scientists and Engineers. Boston: Cengage Learning, 2012. A. Khan, S. Beg, F. Ahsan,& S. Mohsin,"Bionomic Algorithm For Shortest Path First,"Journal of Theoretical & Applied Information Technology, Vol. 34, p. 8, 2011. N. Subadra, M. B. Das, & C. R. S. Rao,"Directed Graph Algoithms for Tours-A Case Study"Journal of Emerging Trends in Engineering & Applied Sciences(JETEAS), 2(4), p.4, 2011. N. Anastopolous, K. Nikas, G. Goumas, & N. Koziris, "Early Eperiences on Accelerating Dikstra's Algorithm Using Transactional Memory,"National Techical University of Athens, p.8, 2008. E. Petroutsos, Mastering Microsoft Visual Basic 2010. USA: John Wiley & Sons, 2010.. P. Goos & B. Jones, Optimal Design of Experiments: A Case Study Approach. USA: John Wiley & Sons, 2011. T. Z. Warfel, Prototyping. Singapore: O'Reilly Media, Inc, 2011. P. S. Ioannis G. Stamelos, Agile Software Development Quality Assurance. Singapore: Idea Group Inc(IGI), 2007. S. McConnell, Software Estimation: Demystifying the Black Art. Singapore: O'Reilly Media Inc., 2009. K. E. Kurbel, The Making of Information Systems: Software Engineering & Management in a Globalized World. Indianapolis: Springer, 2010. S. G. Ganesh, Cracking the C, C++ & Java Interview. Bangalore: McGraw-Hill, 2009. D. E. Knuth, The Art of Computer Programming. Indianapolis: Prentice Hall, 2009. C. P. Williams, Explorations in Quantum Computing. Indianapolis: Springer, 2010.

Similar Items