Sistem Pencarian Rute Terpendek Menggunakan Algoritma A* Pada Jalan Protokol Di Kota Medan Berbasis Web GIS
| Main Author: | Asade, Andre |
|---|---|
| Other Authors: | Sihombing, Poltak, Sitorus, Syahriol |
| Format: | Student Papers |
| Bahasa: | ind |
| Subjects: | |
| Online Access: |
http://repository.usu.ac.id/handle/123456789/30065 |
Daftar Isi:
- Geographic information systems as one area of science that is rapidly growing, is now able to solve the routing problem, both for the problem of finding the shortest route (shortest path), and the problem TSP (traveling salesman problem). Geographic information system has been developed into an application-based GIS applications both desktop and web-based in various fields, such as GIS for spatial planning, GIS for agriculture, trade, and others. However, still little development of GIS applications that can solve the routing problem (routing) on a geographical map, this is possible because there are at least references to the routing problem for the geographical map. In this thesis will be built web-based GIS application to find the shortest route in Medan city, so this applications of this system can help tourists to find the shortest path which can be passed from one place to another place. Applications determining the shortest route with two systems. The first system uses a function of Google Maps which has customized and the second system using the shortest path function Astar owned pgRouting module, which is an additional function of the PostgreSQL / PostGIS to deal with the problem of routing on a geographical map. This application also uses MapScript as a module used to create functions and classes MapServer to run on PHP. While the MapServer itself is a service for processing and displaying spatial data from the database. For data base management system, it used DBMS PostgreSQL / PostGIS that supports spatial data types.
- 071401028