Wiratama, Prima (2021) Penanganan Proses Gawat Darurat Di Daerah Perkotaan Menggunakan Metode Modifikasi Dijkstra. Masters thesis, Institut Teknologi Sepuluh Nopember.
Text
05111750010008-Master_Thesis.pdf - Accepted Version Download (1MB) |
Abstract
Pertolongan gawat darurat mempunyai peran yang sangat vital terhadap penyelamatan nyawa pasien. Proses gawat darurat melibatkan dua tahap yaitu pra rumah sakit dan tahap rumah sakit. Keseluruhan proses gawat darurat memiliki waktu tanggap maksimal 10 menit. Waktu tersebut merupakan akumulasi waktu dari saat pasien di tempat kejadian sampai dengan dia mendapatkan respon dari petugas UGD. Bagian awal dari penanganan gawat darurat pra rumah sakit adalah menentukan rute terpendek dan tercepat ke rumah sakit. Selain itu, ketersediaan rumah sakit yang dituju juga harus dipertimbangkan. Berdasarkan fakta tersebut, Algoritma Dijkstra dapat dimodifikasi untuk menghasilkan rute tependek dengan waktu tercepat dan ketersediaan rumah sakit yang dituju serta menunjang penanganan proses gawat darurat.
====================================================================================================================================
Emergency relief has a very vital role in saving the lives of patients. The emergency
department process involves two stages: prehospital and hospital stage. The entire
emergency department has a maximum response time of 10 minutes. This time is the
accumulation of time from the time the patient is at the scene until he gets a response
from the ER staff. The initial part of handling pre-hospital emergency department is
determining the shortest and fastest route to the hospital. In addition, the availability of
the intended hospital must also be considered. Based on this fact, the Dijkstra algorithm
can be modified to produce a route that is dependent on the fastest time and availability
of the intended hospital and supports the handling of the emergency department.
Item Type: | Thesis (Masters) |
---|---|
Additional Information: | RTIf 005.1 Wir p-1 2021 |
Uncontrolled Keywords: | Gawat Darurat, perkotaan, Modifikasi Dijkstra, Waktu tercepat, Emergency, urban, Dijkstra Modification, Fastest time |
Subjects: | Q Science > QA Mathematics > QA402.5 Genetic algorithms. Interior-point methods. |
Divisions: | Faculty of Intelligent Electrical and Informatics Technology (ELECTICS) > Informatics Engineering > 55101-(S2) Master Thesis |
Depositing User: | - Davi Wah |
Date Deposited: | 20 Jun 2023 06:46 |
Last Modified: | 20 Jun 2023 06:46 |
URI: | http://repository.its.ac.id/id/eprint/98141 |
Actions (login required)
View Item |