Sri Lestari Mahmud
Department of Mathematics, Universitas Negeri Gorontalo

Published : 2 Documents
Claim Missing Document
Articles

## Title

### Found 2 Documents Search

Analisis Dinamik pada Model Matematika SVEIBR dengan Kontrol Optimal Untuk Pengendalian Penyebaran Penyakit Kolera Agusyarif Rezka Nuha; Resmawan Resmawan; Sri Lestari Mahmud; Asriadi Asriadi; Andi Agung; Sri Istiyarti Uswatun Chasanah
Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi EULER: Volume 11 Issue 1 June 2023
Publisher : Universitas Negeri Gorontalo

#### Abstract

Cholera is an infectious disease that attacks the human digestive system and can cause death. This article discusses the research results related to the mathematical model of the spread of cholera in the form of an optimal control system by combining three control strategies: vaccination, quarantine, and environmental sanitation. Pontryagin's maximum principle is applied to obtain optimal conditions based on the control strategy applied. Referring to the optimal conditions set, the model was solved numerically using the Runge-Kutta Order 4 method to describe the theoretical results. The calculation results show that applying the three control strategies in controlling the spread of cholera positively impacts reducing the number of cases of infection so that disease transmission can be discontinued.
Algoritma Dijkstra dan Algoritma Greedy Untuk Optimasi Rute Pengiriman Barang Pada Kantor Pos Gorontalo Novria Fatmawati Lakutu; Sri Lestari Mahmud; Muhammad Rifai Katili; Nisky Imansyah Yahya
Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi EULER: Volume 11 Issue 1 June 2023
Publisher : Universitas Negeri Gorontalo

#### Abstract

Delivery of goods is one of the services used in the online buying and selling process at the Post Office company. Companies need a performance in the distribution of goods that is more time-consuming and cost-efficient, so it requires determination in selecting the shortest path. Many algorithms have been used to help find the shortest path for distributing goods, including the Dijkstra Algorithm and the Greedy Algorithm. In this study, the application of the two algorithms is to find routes between sub-districts that are the destination of goods delivery, then compare to see which algorithm is more optimal. Based on the calculation results, the Dijkstra Algorithm can provide a more optimal solution with a total mileage obtained of 304.90 Km, while the Greedy Algorithm produces a total distance of 441.60 Km.