Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : JMT (Jurnal Matematika dan Terapan)

Model Matematika Co-infection Tuberkulosis dan COVID-19 dengan Intervensi Obat Anti Tuberkulosis (OAT) Safira Putri Islamiati; Eti Dwi Wiraningsih; Devi Eka Wardani Meganingtyas
JMT : Jurnal Matematika dan Terapan Vol 5 No 1 (2023): JMT (Jurnal Matematika dan Terapan)
Publisher : Program Studi Matematika Universitas Negeri Jakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21009/jmt.5.1.4

Abstract

Tuberculosis and COVID-19 are deadly infectious diseases with similar symptoms which mostly attacks lung. When these infections conduct in a single host simultaneously, it will give a low chance of survival. This thesis constructed and analyzed a compartmental tuberculosis and COVID-19 co-infection with anti-tuberculosis drugs intervention model. Our model claimed that the equilibrium point of the co-infection model is stable when the basic reproduction number or the number of the secondary infections is below 1. Numeric simulation was given, using parameter value calculated from the data of tuberculosis and COVID-19 situation in Indonesia period of March 2020 until March 2021 along with the result displayed in graphic. The basic reproduction number were obtained accordingly with the parameter value by 0.1819422898. This means, there are no Tuberculosis and COVID-19 co-infection transmission inside the population.
Masalah Vehicle Routing Problem pada Pengiriman Barang di Kota Bandung Utara dengan menggunakan Kluster K-Means dan Algoritma Nearest Neighbor Debby Agustine; Ibnu Hadi Hadi; Devi Eka Wardani Meganingtyas
JMT : Jurnal Matematika dan Terapan Vol 4 No 2 (2022): JMT (Jurnal Matematika dan Terapan)
Publisher : Program Studi Matematika Universitas Negeri Jakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21009/jmt.4.2.1

Abstract

The Vehicle Routing Problem (VRP) is an optimization problem in determining the route of packet distribution with limited vehicle capacity. Routing in the distribution of packets is important so that the shortest route will be sought so that the package arrives on time. One of the algorithms that discusses the search for vehicle routes with VRP problems is the Nearest Neighbor Algorithm, as for the stages in finding the best route by enumerating all possible sequences of existing routes and selecting the best set of routes in order to find the shortest route from one node to all other nodes. so it becomes a connected route.