scholarly journals IMPLEMENTASI ALGORITMA BELLMAND FORD UNTUK MENJEMPUT PASIEN MENGUNAKAN MOBIL AMBULANCE DENGAN LOCATION BASED SERVICE BERBASIS ANDORID STUDIO (Studi Kasus: Rsud Linggajati)

2019 ◽  
Vol 5 (2) ◽  
Author(s):  
Lukman Pirmansah ◽  
Dadang Hamdani ◽  
Yati Nurhayati
Keyword(s):  
Software Development ◽  
Vital Role ◽  
Location Based Service ◽  
Short Route ◽  
Development Method ◽  
Traffic Conditions ◽  
Shortest Route ◽  
Starting Point ◽  
Unified Process ◽  
Destination Point

Abstrak�� Ambulance berperan penting dalam penanganan pasien gawat darurat yang membutuhkan kecepatan dalam penanganan pasien. Namun demikian, karena kondisi lalu lintas dijalan raya ambulance seringkali mengalami keterlambatan kedatangan maupun keterlambatan dalam membawa pasien kerumah sakit. Maka dari itu, tujuan dari penelitian ini adalah untuk membuat aplikasi yang dapat memudahkan supir mobil ambulance untuk menemukan rute terpendek dari titik asal ke titik tujuan. Metode pengembangan perangkat lunak yang digunakan adalah Rational Unified Proccess (RUP) yang memiliki 4 tahapan : Inception, Elaboration, Construction, dan Transition. Algortima Bellmand ford merupakan algortima pencarian rute yang dapat menemukan rute terpendek dari titik awal (rumah sakit) sampai ke titik tujuan dengan cepat, yang merupakan pencarian rute terpendek dengan memperhitungkan semua rute. Aplikasi ini dibangun dengan menggunakan bahasa pemograman Android Studio untuk editor yang dimana bisa diakses oleh supir ambulance, serta admin melakukan pengolahan data titik titik tujuan dengan PHP, database MYSQL dan notepad++ untuk editor. Aplikasi ini telah diuji dengan menggunakan whitebox dan blacbox, hasil akhirnya aplikasi ini dapat membantu supir ambulance dalam menemukan rute terpendek ke titik tujuan sehingga dapat lebih cepat dalam menjemput dan menangani pasien yang membutuhkan pertolongan yang harus segera dibawa ke rumah sakit�Kata kunci : Rumah sakit, supir ambulance, pasien, algoritma Bellmand Ford, rute terpendek.��AbstractAmbulance plays a vital role in in the emergency of patients that require the speed of care. Nevertheless, because of the traffic conditions, the ambulance has often been delayed in carrying the patient to the hospital. Therefore, the purpose of this study is to make an application that can facilitate an ambulance to find the shortest route to the destination. Software development method that is used is Rational Unified Process (RUP) that has 4 steps : Inception, Elaboration, Construction and Transition.� Bellmand ford algorithm is a searching algorithm that can find the shortest route from the starting point (hospital) to the destination quickly. It is a short route searching by calculating all routes. The application is built using Android Studio as an editor to be accessed by an ambulance driver and PHP Programming for admin to process a data of destination point, MySQL as database and notepad++ for editor. This application has been tested by using the whitebox and blacbox, the outcome of this application can help the ambulance driver to find the shortest route to the point where it can be faster to pick up and deal with a patient who needs help to get to the hospital.�Keyword : Hospital, ambulance driver, patient, Bellmand Ford algorithm, shortest route

scholarly journals Penerapan Metode Rational Unified Process (RUP) Dalam Pengembangan Sistem Informasi Medical Check Up Pada Citra Medical Centre

2020 ◽  
Vol 2 (1) ◽  
pp. 76-88
Author(s):  
Ririn Perwitasari ◽  
Royana Afawani ◽  
Sri Endang Anjarwani
Keyword(s):  
Software Development ◽  
Development Process ◽  
System Development ◽  
Medical Center ◽  
Development Method ◽  
Development Life Cycle ◽  
Project Risks ◽  
Unified Process ◽  
Software Development Life Cycle ◽  
Time Required

The Rational Unified Process (RUP) method is an iterative and incremental software development method that focuses on architecture. The RUP method will be used in the development of a medical check-up information system on a Citra medical center because this method is proactively able to resolve the project risks associated with the client's evolving requirements requiring careful change request management. Less time is required for integration as the process of integration goes on throughout the software development life cycle and the development time required is less due to using of components over and over. RUP involves The client’s in The system development process, so the result will be accordance with client  wishes. The system built is expected to make it easier for employees to manage patient data from anywhere and anytime.

Shortest Route Application via Dynamic Programming in the Transportation Networks

2021 ◽  
pp. 362-371
Author(s):  
Arzu Eren Şenaras ◽  
Şahin İnanç ◽  
Hayrettin Kemal Sezen ◽  
Onur Mesut Şenaras
Keyword(s):  
Dynamic Programming ◽  
Shortest Path ◽  
Dynamic Programming Method ◽  
Programming Approach ◽  
Dynamic Programming Approach ◽  
Transportation Sector ◽  
Shortest Route ◽  
Starting Point ◽  
Visual Basic Application ◽  
Destination Point

The purpose of this study is to develop an application for finding the shortest path in the transportation sector. The application was developed using the dynamic programming method in MS Excel Visual Basic application. These types of problems are also called stagecoach problems. The purpose of the problem is finding the shortest path between the starting point (node) and the destination point. Values are related to the roads in the network to specify the distance between two nodes. In case of a small number of nodes (activities), a solution can be reached by evaluating all options. But the number of possible options to be scanned for real problems is quite large. In such cases, a suitable method is needed for the solution. It can produce effective solutions with the dynamic programming approach.

The Map-Based Shortest Route Selection by Using Ant Colony Optimization Algorithm

2018 ◽  
Vol 1 (1) ◽  
pp. 15
Author(s):  
Achmad Fanany Onnilita Gaffar ◽  
Agusma Wajiansyah ◽  
Supriadi Supriadi
Keyword(s):  
Ant Colony Optimization ◽  
Shortest Path ◽  
Optimization Algorithm ◽  
Optimization Problems ◽  
Google Earth ◽  
Ant Colony ◽  
Food Sources ◽  
Shortest Route ◽  
Study Results ◽  
Destination Point

The shortest path problem is one of the optimization problems where the optimization value is a distance. In general, solving the problem of the shortest route search can be done using two methods, namely conventional methods and heuristic methods. The Ant Colony Optimization (ACO) is the one of the optimization algorithm based on heuristic method. ACO is adopted from the behavior of ant colonies which naturally able to find the shortest route on the way from the nest to the food sources. In this study, ACO is used to determine the shortest route from Bumi Senyiur Hotel (origin point) to East Kalimantan Governor's Office (destination point). The selection of the origin and destination points is based on a large number of possible major roads connecting the two points. The data source used is the base map of Samarinda City which is cropped on certain coordinates by using Google Earth app which covers the origin and destination points selected. The data pre-processing is performed on the base map image of the acquisition results to obtain its numerical data. ACO is implemented on the data to obtain the shortest path from the origin and destination point that has been determined. From the study results obtained that the number of ants that have been used has an effect on the increase of possible solutions to optimal. The number of tours effect on the number of pheromones that are left on each edge passed ant. With the global pheromone update on each tour then there is a possibility that the path that has passed the ant will run out of pheromone at the end of the tour. This causes the possibility of inconsistent results when using the number of ants smaller than the number of tours.

Research on MES Domain Analysis Driven by Ontology

2010 ◽  
Vol 20-23 ◽  
pp. 1084-1090 ◽  
Author(s):  
Wen Long
Keyword(s):  
Control System ◽  
Software Development ◽  
Method Development ◽  
Domain Analysis ◽  
Manufacturing Execution System ◽  
Development Method ◽  
And Performance ◽  
And Control ◽  
Plan Management ◽  
Manufacturing Execution

Manufacturing Execution System (MES) links plan management and workshop control in an enterprise, which is an integrative management and control system of workshop production oriented to manufacturing process. To overcome the difficulties of traditional software development method, development of MES based on component is adopted to prompt development efficiency and performance of MES, which can be more reconstructing, reuse, expansion and integration, and MES domain analysis driven by ontology is investigated in detail. MES domain analysis driven by ontology is feasible and efficient through developing a pharmaceutics MES which applied in a pharmaceutics manufacturing factory.

Software Evolution Rules with Condition Constrains to Support Component Type Matching Based on Bigraph

2018 ◽  
Vol 28 (10) ◽  
pp. 1429-1453 ◽  
Author(s):  
Chao-Ze Lu ◽  
Guo-Sun Zeng ◽  
Wen-Juan Liu
Keyword(s):  
Information System ◽  
Software Development ◽  
Software Architecture ◽  
Software Evolution ◽  
Type System ◽  
Reaction System ◽  
Basic Component ◽  
Development Method ◽  
Component Type ◽  
Tourism Information

With the gradual maturity of component oriented software development method, component-based software evolution technology has become hot research in academia and industry. Although many evolution rules are designed, they rarely consider component type-mismatched problem in evolution rules. This has led to evolution rules that often run error in software evolution execution. Hence, focusing on the mismatch problem of component type in software evolution, this paper addresses various evolution rules with condition constrains to support component type matching. First, we use the bigraph theory to model the software architecture and employ bigraph term language to describe the basic component evolution operations. Second, we join type system into the term language and use the type term language to express the condition constraints on position and connection for component evolution rules. These condition constraints can guarantee the type-matched among components that participate in software evolution. Furthermore, we show that the component type-matched still kept during a number of different evolution rules are used in the whole software evolution reaction system. Finally, two cases study of evolution progress of ATM system and tourism information system are presented. Two cases illustrate the effectiveness of our approach.

Sign in / Sign up

Export Citation Format

Share Document