#TITLE_ALTERNATIVE#
Traffic jam is a common thing, especially in big cities such as Jakarta and Bandung. Nowadays, traffic information can be determined very easily so that road users can determine the routes to a destination by considering the traffic information they know. In routing, a lot of things may be considere...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/14374 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | Traffic jam is a common thing, especially in big cities such as Jakarta and Bandung. Nowadays, traffic information can be determined very easily so that road users can determine the routes to a destination by considering the traffic information they know. In routing, a lot of things may be considered when routing such as travel costs, travel time, trip mileage, and many more. Arc-node topology data structure allows us to analyze the road network. This study created a model for routing that considers traffic information and selection of road class as a travel expenses by using the Shortest Path Finding algorithm invented by Dijkstra. Network analysis performed with the open source Database Management System called PostgreSQL including the PostGIS and PgRouting extension. Study shows model were able to determine the solution of route selection considering the traffic information and road class selection. |
|---|