Penentuan Aliran Maksimum pada Jaringan Pendistribusian Gas Menggunakan Algoritma Edmonds Karp
Eliana, Tantri (2025) Penentuan Aliran Maksimum pada Jaringan Pendistribusian Gas Menggunakan Algoritma Edmonds Karp. Skripsi thesis, Universitas Tanjungpura.
|
PDF (Cover-Bab1)
Cover-Bab1_H1011201043.pdf - Published Version Download (1MB) |
|
|
PDF (H1011201043_ELIANA_TANTRI)
H1011201043_ELIANA_TANTRI.pdf - Accepted Version Restricted to Repository staff only Download (3MB) |
Abstract
PT. Livina Aurora Cemerlang is a liquefied petroleum gas (LPG) company that distributes non-subsidized gas to several distribution points. The company distributes gas with varying delivery request volumes for each distribution point, limited vehicle capacity, and distribution points spread out over considerable distances from one point to another. Therefore, the company requires a strategy to ensure efficient distribution by determining the maximum flow rate. The problem addressed in this study is the LPG distribution network, represented as a directed graph, where each edge has a weight. Therefore, the objective of this study is to determine the maximum flow in the LPG distribution network by considering the capacity constraints of each edge, the flow constraints at the source node and destination node using the Edmonds Karp Algorithm in the LPG distribution network, where the search for the augmenting path uses the Breadth First Search (BFS) Algorithm. The steps in finding the maximum flow are as follows: first, convert the distribution network into a directed graph; second, start by setting the initial flow value to 0 on all edges. The third step is to identify the augmenting path, which is the directed path connecting the source node and the destination node using the BFS algorithm. The fourth step is to determine the minimum remaining capacity of the edges on the obtained augmenting path; the minimum remaining capacity is used to optimize the flow on the augmenting path. This process is repeated until no more augmenting paths are found, resulting in the maximum flow value in the gas distribution network. The maximum flow search using the Edmonds-Karp Algorithm on the 5.5 kg LPG gas distribution network yielded 61 gas cylinders, while on the 12 kg LPG gas distribution network, it yielded 53 gas cylinders with 5 augmenting paths.
| Item Type: | Thesis (Skripsi) | ||||||
|---|---|---|---|---|---|---|---|
| Creators: |
|
||||||
| Subjects: | 500 – Ilmu Pengetahuan > 510 Matematika > 518 Analisis numerik, analisa numerik | ||||||
| Divisions: | Fakultas Matematika dan Ilmu Pengetahuan Alam > Matematika S1 | ||||||
| SWORD Depositor: | Rudiarti Rudiarti | ||||||
| Depositing User: | Rudiarti Rudiarti | ||||||
| Date Deposited: | 05 Aug 2026 03:55 | ||||||
| Last Modified: | 05 Aug 2026 03:55 | ||||||
| URI: | https://repository.untan.ac.id/id/eprint/7065 |
Actions (login required)
![]() |
View Item |
