DESAIN JARINGAN PIPA GAS DI PULAU JAWA DENGAN STEINER TREE
Steiner tree is one of the topics in Graph Theory which is widely used for constructing an efficient network. In this final project, an application to find a Steiner tree in a particular network is developed. This application is implemented to find a gas pipeline network in Java Island which conn...
Saved in:
Main Author: | |
---|---|
Format: | Final Project |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/77094 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
id |
id-itb.:77094 |
---|---|
spelling |
id-itb.:770942023-08-22T10:43:45ZDESAIN JARINGAN PIPA GAS DI PULAU JAWA DENGAN STEINER TREE Pradipto, Adie Indonesia Final Project Steiner tree, heuristic, brute force, minimal spanning tree, weight. INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/77094 Steiner tree is one of the topics in Graph Theory which is widely used for constructing an efficient network. In this final project, an application to find a Steiner tree in a particular network is developed. This application is implemented to find a gas pipeline network in Java Island which connects all cities that have gas or fuel depot with minimum length. In addition, the application also considers topographical factor (height difference). The topographical factor should be considered since Java Island has various height differences. Heuristic developed by Markowsky et al is used for constructing the network in this final project. The algorithm is chosen based on its faster running time compared with algorithm that search Steiner tree by using brute force search to check all possibilities of minimal spanning tree, the weight of a Steiner tree produced by the heuristic algorithm may not be the minimum weight, however this weight will not exceeds a particular upper bound. text |
institution |
Institut Teknologi Bandung |
building |
Institut Teknologi Bandung Library |
continent |
Asia |
country |
Indonesia Indonesia |
content_provider |
Institut Teknologi Bandung |
collection |
Digital ITB |
language |
Indonesia |
description |
Steiner tree is one of the topics in Graph Theory which is widely used for
constructing an efficient network. In this final project, an application to find a Steiner
tree in a particular network is developed. This application is implemented to find a
gas pipeline network in Java Island which connects all cities that have gas or fuel
depot with minimum length. In addition, the application also considers topographical
factor (height difference). The topographical factor should be considered since Java
Island has various height differences. Heuristic developed by Markowsky et al is
used for constructing the network in this final project. The algorithm is chosen based
on its faster running time compared with algorithm that search Steiner tree by using
brute force search to check all possibilities of minimal spanning tree, the weight of a
Steiner tree produced by the heuristic algorithm may not be the minimum weight,
however this weight will not exceeds a particular upper bound. |
format |
Final Project |
author |
Pradipto, Adie |
spellingShingle |
Pradipto, Adie DESAIN JARINGAN PIPA GAS DI PULAU JAWA DENGAN STEINER TREE |
author_facet |
Pradipto, Adie |
author_sort |
Pradipto, Adie |
title |
DESAIN JARINGAN PIPA GAS DI PULAU JAWA DENGAN STEINER TREE |
title_short |
DESAIN JARINGAN PIPA GAS DI PULAU JAWA DENGAN STEINER TREE |
title_full |
DESAIN JARINGAN PIPA GAS DI PULAU JAWA DENGAN STEINER TREE |
title_fullStr |
DESAIN JARINGAN PIPA GAS DI PULAU JAWA DENGAN STEINER TREE |
title_full_unstemmed |
DESAIN JARINGAN PIPA GAS DI PULAU JAWA DENGAN STEINER TREE |
title_sort |
desain jaringan pipa gas di pulau jawa dengan steiner tree |
url |
https://digilib.itb.ac.id/gdl/view/77094 |
_version_ |
1822008171575640064 |