Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim

Imagine you are hungry and want to drive from a house to a restaurant that serves delicious food. People usually hard to identify the best route to get to the desired location without any navigation tools. As a result, they can be easily lost in the unfamiliar area. People will normally refer to the...

Full description

Saved in:
Bibliographic Details
Main Author: Lukman Hakim, Mohamad Aliff Hakimi
Format: Thesis
Language:English
Published: 2017
Subjects:
Online Access:https://ir.uitm.edu.my/id/eprint/69619/1/69619.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
id my-uitm-ir.69619
record_format uketd_dc
spelling my-uitm-ir.696192022-11-02T04:04:21Z Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim 2017-01 Lukman Hakim, Mohamad Aliff Hakimi Data processing Instruments and machines Electronic Computers. Computer Science Mobile computing Evolutionary programming (Computer science). Genetic algorithms Computer software Application program interfaces Configuration management Development. UML (Computer science) Expert systems (Computer science). Fuzzy expert systems Database management Web-based user interfaces. User interfaces (Computer systems) Imagine you are hungry and want to drive from a house to a restaurant that serves delicious food. People usually hard to identify the best route to get to the desired location without any navigation tools. As a result, they can be easily lost in the unfamiliar area. People will normally refer to the signboards or ask around for direction in which will either ending up reaching the destination or the other way round. These will definitely causing loosing lots of time, energy and cost. In this research, a navigation system called ResLoc is being proposed. This system will help user especially for the food lovers in finding their favourite restaurants around Kota Bharu. This route-finding problem is one of the most important computer applications in the transportation industry. In network theory, it’s known as the shortest-path problem, and Dijkstra’s algorithm is usually used to solve it. Dijkstra’s algorithm is one of the classic shortest path search algorithms. Dijkstra’s algorithm is the technique that can solve the problem by itself. The algorithm searches in a weighted directed network to find the shortest path from a given node to every other node in the network. For the result, Djikstra’s algorithm will find the shortest path towards the desired restaurants regarding to the user current locations besides the system will also generate map towards the locations. 2017-01 Thesis https://ir.uitm.edu.my/id/eprint/69619/ https://ir.uitm.edu.my/id/eprint/69619/1/69619.pdf text en public degree Universiti Teknologi MARA, Terengganu Faculty of Computer and Mathematical Sciences Engku Azam, Engku Zain
institution Universiti Teknologi MARA
collection UiTM Institutional Repository
language English
advisor Engku Azam, Engku Zain
topic Data processing
Instruments and machines
Data processing
Mobile computing
Data processing
Computer software
Application program interfaces
Configuration management
Data processing
Data processing
Database management
Data processing
spellingShingle Data processing
Instruments and machines
Data processing
Mobile computing
Data processing
Computer software
Application program interfaces
Configuration management
Data processing
Data processing
Database management
Data processing
Lukman Hakim, Mohamad Aliff Hakimi
Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim
description Imagine you are hungry and want to drive from a house to a restaurant that serves delicious food. People usually hard to identify the best route to get to the desired location without any navigation tools. As a result, they can be easily lost in the unfamiliar area. People will normally refer to the signboards or ask around for direction in which will either ending up reaching the destination or the other way round. These will definitely causing loosing lots of time, energy and cost. In this research, a navigation system called ResLoc is being proposed. This system will help user especially for the food lovers in finding their favourite restaurants around Kota Bharu. This route-finding problem is one of the most important computer applications in the transportation industry. In network theory, it’s known as the shortest-path problem, and Dijkstra’s algorithm is usually used to solve it. Dijkstra’s algorithm is one of the classic shortest path search algorithms. Dijkstra’s algorithm is the technique that can solve the problem by itself. The algorithm searches in a weighted directed network to find the shortest path from a given node to every other node in the network. For the result, Djikstra’s algorithm will find the shortest path towards the desired restaurants regarding to the user current locations besides the system will also generate map towards the locations.
format Thesis
qualification_level Bachelor degree
author Lukman Hakim, Mohamad Aliff Hakimi
author_facet Lukman Hakim, Mohamad Aliff Hakimi
author_sort Lukman Hakim, Mohamad Aliff Hakimi
title Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim
title_short Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim
title_full Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim
title_fullStr Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim
title_full_unstemmed Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim
title_sort restaurant locator using djikstra algorithm / mohamad aliff hakimi lukman hakim
granting_institution Universiti Teknologi MARA, Terengganu
granting_department Faculty of Computer and Mathematical Sciences
publishDate 2017
url https://ir.uitm.edu.my/id/eprint/69619/1/69619.pdf
_version_ 1783735897345228800