Claim Missing Document
Check
Articles

Found 13 Documents
Search

Model Matematika dan Simulasi Penyebaran Perokok Dalam Suatu Populasi Menggunakan Matlab Roni Al Maududi; Rini Widia Putri Z; Purni Munah Hartuti
JOSTECH Journal of Science and Technology Vol 3, No 1: Maret 2023
Publisher : UIN Imam Bonjol Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15548/jostech.v3i1.5729

Abstract

One of the social problems that is still controversial is smoking. This is closely related to public health, because smokers have a great risk of spreading disease either directly to smokers themselves or indirectly to other people who do not smoke but are in the same environment or population as smokers, such as cancer, heart disease. , caries, and others caused by the substance content of the smoked cigarettes. The more smokers in a population, the greater the chance of increasing the number of smokers in that population, which directly or indirectly means increasing the spread of the diseases that have been mentioned. The purpose of this research is to construct a mathematical model and simulate the distribution of smokers in a certain population using Matlab. The variables that make up the Mathematical model are divided into 3 classes, namely prospective smokers (), regular smokers (), and ex-smokers (). The method used in this research is the method of literature study and literature related to research and simulation using Matlab. At the end of the study, the value of the basic reproduction number () will be analyzed to determine the dynamics that occur in the population and the simulation results of the mathematical model formed. The results of this study are a depiction of how much influence the presence of smokers has in a population by looking at the parameters that affect changes in the value significantly.
Minimum Spanning Tree Rute Shopping Mall di Kota Depok dengan Menggunakan Algoritma Prim Purni Munah Hartuti; Rini Widia Putri Z; Roni Al Maududi
JOSTECH Journal of Science and Technology Vol 6, No 1: Maret 2026
Publisher : UIN Imam Bonjol Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15548/jostech.v6i1.13248

Abstract

Kota Depok adalah sebuah kota yang terletak di Provinsi Jawa Barat, Indonesia. Kota Depok merupakan bagian dari kawasan metropolitan Jabodetabekpunjur dan berada di bagian selatan Daerah Khusus Ibukota Jakarta. Kota Depok dibentuk dari wilayah Kota Administratif Depok dengan penambahan wilayah dari Kecamatan Limo, Kecamatan Cimanggis, dan Kecamatan Sawangan, serta sebagian desa dari Kecamatan Bojonggede yang digabungkan dengan Kecamatan Pancoran Mas. Depok seringkali melakukan pembangunan pada lahan salah satunya pembangunan pusat perbelanjaan. Banyaknya pembangunan pusat perbelanjaan membuat para penduduk lokal maupun luar ingin mengunjungi pusat perbelanjaan yang ada di Depok. Terdapat 9 pusat perbelanjaan terpopuler yang digunakan dalam penelitian ini. Tujuan penelitian ini yaitu menentukan rute terpendek antar pusat perbelanjaan di Depok dengan menggunakan Algoritma Prim. Algoritma ini menentukan rute terpendek dengan membentuk pohon merentang minimum.
Pemodelan Graf dan Optimasi Minimum Path Cover pada DAG dengan Algoritma Hopcroft–Karp pada Penjadwalan KA Sawunggalih Purni Munah Hartuti; Rini Widia Putri Z; Roni Al Maududi
MAJAMATH: Jurnal Matematika dan Pendidikan Matematika Vol. 9 No. 2 (2026): Vol. 9 No. 2 September 2026
Publisher : Prodi Pendidikan matematika Universitas Islam Majapahit (UNIM), Mojokerto, Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.36815/majamath.v9i2.4694

Abstract

Optimizing the use of train sets is an important problem in the management of rail transportation operations. From the naked eye, the equal number of trips in two directions does not necessarily reflect the minimum number of circuits required operationally. This research aims to model the Sawunggalih train travel schedule in the form of a Directed Acyclic Graph (DAG) and determine the minimum number of trains using the Minimum Path Cover (MPC) approach. DAG is built based on the possibility of continuing the journey without time and location conflicts. Next, the graph is transformed into a bipartite graph to obtain maximum matching using the Hopcroft–Karp algorithm. The research results show that from six daily trips, the maximum matching value obtained produces a Minimum Path Cover of two, so theoretically only two trains are needed to serve the entire schedule without conflict. This approach proves that graph modeling provides a more efficient mathematical solution than conventional estimation based on operational intuition.