Search Results - Dijkstra’s algorithm

Smart indoor parking system based on Dijkstra's algorithm by Ata, Karimeh Ibrahim Mohammad, Che Soh, Azura, Ishak, Asnor Juraiza, Jaafar, Haslina, Khairuddin, N. A.

“…Smart Indoor Parking System is a parking system that assigns the car to the nearest parking to the entrance by using Dijkstra’s Algorithm and assigns according to the size of the car. …”
Get full text
Get full text

Analysis of Dijkstra’s and A* algorithm to find the shortest path by Alija, Amani Saleh

“…There are so many algorithms used to find the shortest path such as Dijkstra, A* algorithm, Genetic algorithm, Floyd algorithm and Ant algorithm. …”
Get full text
Get full text
Get full text
Get full text

Intelligent guidance parking system using modified Dijkstra's algorithm by Jaafar, Haslina, Zabidi, Muhamad Hidayat, Che Soh, Azura, Thong, Peng Hoong, Shafie, Suhaidi, Ahmad, Siti Anom

“…This paper presents the intelligent parking system which apply Dijkstra’s algorithm in finding the shortest path. The proposed intelligent parking guidance system is a system that assigns the nearest vacant bay to drivers with necessary direction printed on the ticket so that drivers are able to find the 'best' lot with the minimum amount of time. …”
Get full text
Get full text

Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

“…Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
Get full text
Get full text

A smart guidance indoor parking system based on Dijkstra's algorithm and ant colony algorithm by Mohammad Ata, Karimeh Ibrahim, Che Soh, Azura, Ishak, Asnor Juraiza, Jaafar, Haslina

“…This paper introduces a smart guidance indoor parking system based on embedded system integrated with both the Dijkstra's algorithm and Ant Colony algorithm (ACO) to provide drivers with an efficient path to the nearest parking bay. …”
Get full text
Get full text

An application of Dijkstra’s algorithm model in finding shortest travel time in KLCC by Mohd Ghazali, Jamilah, Mohd Adnan, Raudah, Mohd Ismail, Nurul Izzati, Mohd Aripen, Nur Shahirah, Mohd. Shamsuri, Muhammad Izzwan Syahmi, Mustaffa, Nur Aqilah Zawani, Abdul Rahim, Nur Hanis

Get full text
Get full text

Efficient heuristics for energy-aware routing in networks with bundled links by Lin, Gongqi, Soh, Sieteng, Chin, K., Lazarescu, Mihai

Subjects: “…Dijkstra’s algorithm…”
Get full text

Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system by Mohammad Ata, Karimeh Ibrahim, Che Soh, Azura, Ishak, Asnor Juraiza, Jaafar, Haslina

“…A common algorithm to solve the single-source shortest path (SSSP) is the Dijkstra algorithm. …”
Get full text
Get full text

An analysis of the effect of heterogeneously distributed inertia constant in generation mix power system by using the graph theory and Dijkstra’s Algorithm by Harshada Nerkar, Kundu, Prasanta, Chowdhury, Anandita

“…In this paper, we calculate the shortest path between the nodes or substations by using Dijkstra’s algorithm. The betweenness centrality of the node detects the vulnerable nodes in the system from the frequency response point of view.…”
Get full text
Get full text

Shortest Path Trajectory System Based on Dijkstra Algorithm by Putri, Indah Pratiwi

“…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. …”
Get full text
Get full text

Simulasi jarak terdekat menggunakan algoritma dijkstra / Mohd Yohan Ibrahim by Mohd Yohan, Ibrahim

“…Jadual perjalanan sepanjang projek ini adalah seperti di bahagian lampiran. Algoritma Dijkstra atau lebih dikenali dengan Dijkstra's Algorithm diterangkan secara terperinci dalam laporan ini. …”
Get full text
Get full text

Sistem navigasi berasaskan algoritma Dijkstra di dalam persekitaran tiga dimensi by Ujang, Muhamad Uznir

“…Network analysis in navigation process can minimize transportation cost, disaster or accident impact and also it can provide right decision for the best route in certain situations. Dijkstra's algorithm is one of the algorithms that could be used in network analysis process especially for 2D shortest route data. …”
Get full text
Get full text

Routing problem in rectangular mesh network using Dijkstra’s based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

“…Therefore, developing a shortest path based routing algorithm is in need. In this research, Dijkstra’s algorithm is used to establish the shortest connection for each net. …”
Get full text
Get full text
Get full text

A Dijkstra’s Mobile Web Application Engine for Generating Integrated Light Rail Transit Route by Haziq Lim, AM, Wan Sazli, NS, Hussin, B., Azlianor, A. A., Suhaizan, SM, Massila, K

“…Currently, our research is focusing on Dijkstra’s algorithms to provide more effective and intelligent shortest path system to provide the solution for traveler to reach the desired destination. …”
Get full text
Get full text

Simulation Of Path Optimisation Algorithms by Sim, Choon Yeee

“…The main concern is to find and calculate the shortest distance from one node to another in the most efficient way. 3 algorithms (A* algorithm, Dijkstra algorithm and Greedy algorithm) and 2 concepts (Bidirectional Searching and Replanning) are explored and simulated. …”
Get full text
Get full text

Accelerating graph algorithms with priority queue processor by Heng Sun, Ch'ng, Eik Wee, Chew, Shaikh-Husin, Nasir, Hani, Mohamed Khalil

“…DijkstraÂ’s algorithm is chosen as the target implementation, as many state-of-the-art graph algorithms use DijkstraÂ’s algorithm at the heart of their computational engine. …”
Get full text
Get full text

Traffic management algorithms for LEO satellite networks by Huyop @ Ayop, Fahrul Hakim

“…In satellite network with Multi Protocol Label Switching (MPLS), routing with Extended Dijkstra Shortest Path algorithm is done to improve QoS by minimizing the link shared between UDP and TCP traffic flows. …”
Get full text
Get full text

A hybrid algorithm for finding shortest path in network routing. by Soltan Aghaei, Mohammad Reza, Ahmad Zulkarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

“…Finally, we represent the result of implementing and simulating Dijkstra's algorithm as the probabilistic quantum-classical algorithm.…”
Get full text

Malaysia network transit route adviser: hybrid didistra's algorithm by Mohd Syafiq, Bachok

“…According to this problem MANTRA provide the solution to resolve the problem and help the tourist to plan their journey using Hybrid Dijkstra algorithm in the Mantra System.…”
Get full text
Get full text

An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network by Noraziah, Adzhar, Shaharuddin, Salleh

“…In order to achieve this objective, each node must be connected in its shortest way as possible. We start our algorithm by designing shortest path algorithm based on Dijkstra's method. …”
Get full text
Get full text