Article Per Year (5 Year)
p-Index From 2020 - 2025
6.609
P-Index
This Author published in this journals
All Journal Wahana Matematika dan Sains Matematika: Jurnal Teori dan Terapan CAUCHY: Jurnal Matematika Murni dan Aplikasi Jurnal Matematika & Sains SITEKIN: Jurnal Sains, Teknologi dan Industri Kubik Jurnal Fourier Jurnal Sains Matematika dan Statistika NUMERICAL (Jurnal Matematika dan Pendidikan Matematika) Journal of Energy, Mechanical, Material and Manufacturing Engineering Desimal: Jurnal Matematika Seminar Nasional Teknologi Informasi Komunikasi dan Industri Zeta - Math Journal Math Educa Journal Square : Journal of Mathematics and Mathematics Education Jurnal Lebesgue : Jurnal Ilmiah Pendidikan Matematika, Matematika dan Statistika KUBIK: Jurnal Publikasi Ilmiah Matematika Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi Mathematics and Applications (MAp) Journal Journal of Fundamental Mathematics and Applications (JFMA) Makara Journal of Science
Sri Basriati
Fakultas Sains Dan Teknologi Universitas Islam Negeri (UIN) Sultan Syarif Kasim Riau
Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Electrical & Electronics Engineering Industrial & Manufacturing Engineering Mathematics Mechanical Engineering Social Sciences Other

Published : 73 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 73 Documents
Search

 4   5   6   7   8 
PENERAPAN PROGRAM LINIER MENGGUNAKAN METODE DUAL SIMPLEKS DAN METODE QUICK SIMPLEKS UNTUK MEMINIMUMKAN BIAYA (STUDI KASUS: KELOMPOK WANITA TANI (KWT) SENTOSA SANTUL) Elfira - Safitri; Sri Basriati; Elvina Andiani
Journal of Fundamental Mathematics and Applications (JFMA) Vol 4, No 1 (2021)
Publisher : Diponegoro University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1972.245 KB) | DOI: 10.14710/jfma.v4i1.8879

Abstract

The Sentosa  Santul Women Farmers Group (KWT) is a group of women farmers in Dusun Santul, Kampar Utara District an is engaged in the field of food crops is chili. The Sentosa Santul Women Farmers group (KWT) uses 4 types of fertilizers for chili plant fertilization, namely hydro complex fertilizer, phonska, NPK Zamrud and goat manure.The KWT wants the minimum fertilizer cost but the nutrients in the plants are met. The method used in this research is the dual simplex method and the quick simplex method. The purpose of this study is to determine the minimum costs that must be incurred by the Womens Farmer Group (KWT) for fertilization using the dual simplex method and the quick simplex method to obtain an optimum and feasible solution. For the dual simplex method, the optimum and feasible solution were obtained using the Gauss Jordanelimination. While the quick simplex method, the solution is illustrated using a matrix to reduce the number of iterations needed to achieve the optimal solution. Based on the research result, it is found that the quick simplex method is more efficient than the dual simplex method. This can be seen from the number of iterations carried out. Dual simplex method iteration there are two iterations and quick simplex one iteration. The dual simplex method and the quick simplex method produce the same value.
Implementasi Algoritma Bellman-Ford dalam Menentukan Lintasan Terpendek Truk Pembuangan Sampah Sri Basriati; Elfira Safitri; She Arssy Yesti; Nilwan Andiraja
Seminar Nasional Teknologi Informasi Komunikasi dan Industri 2022: SNTIKI 14
Publisher : UIN Sultan Syarif Kasim Riau

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Persoalan menentukan lintasan terpendek berhubungan dengan jarak tempuh tercepat. Dalam kehidupan masyarakat di perkotaan hal ini sangat penting, seperti pada pengangkutan sampah. Untuk sampai ketempat tujuan, jumlah rute yang ditempuh akan menjadi patokan. Dengan ini dapat ditemukan titik mana saja yang ditempuh sehingga dapat mencapai titik tujuan dengan jarak yang singkat menggunakan algoritma Bellman-Ford. Penelitian ini menjelaskan tentang penentuan lintasan terpendek truk pembuangan sampah di kota Taluk Kuantan menggunakan algoritma Bellman-Ford. Langkah-langkah pada metode ini yaitu mengubah peta menjadi graf berarah dan berbobot, menentukan titik awal dan titik akhir, memberi tanda 0 pada titik awal dan tanda pada titik yang lainnya, melakukan iterasi secara berulang dimulai dari titik awal hingga ke titik akhir atau tujuan. Tujuan dari penelitian ini yaitu menentukan lintasan terpendek agar waktu dan biaya yang terpakai lebih efisien. Data diperoleh berupa TPS yang dikunjungi truk pembuangan sampah setiap harinya, dimulai dari kantor Dinas Lingkungan Hidup Kuantan Singingi hingga ke TPA sentajo. Hasil penelitian menunjukkan bahwa terdapat 1 lintasan terpendek dari Kantor Dinas Lingkungan Hidup Kuantan Singingi  ke TPA sentajo dengan jarak tempuh minimum 17,2 km. Kata kunci: Algoritma Bellman-Ford, lintasan terpendek, rute
Optimization of Drinking Water Distribution Costs Using Vogel's Approximation Method (VAM) and Three Modified Methods of VAM (Case Study: Sikumbang Kampar Spring) Sri Basriati; Elfira Safitri; Dewi Sartika
Numerical: Jurnal Matematika dan Pendidikan Matematika Vol. 5 No. 2 (2021)
Publisher : Institut Agama Islam Ma'arif NU (IAIMNU) Metro Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25217/numerical.v5i2.1419

Abstract

Distribution system Springs Sikumbang Kampar is from the primary seller, and the distributor distributes it to the public. The Sikumbang Kampar Springs distributor is experiencing the problem of increasing the cost of distribution because it does not have a distribution pattern. Therefore, it takes a transportation model to complain distribution problems experienced by the distributor of Springs Sikumbang Kampar. The research was conducted to obtain the minimum cost in distributing the drinking water to help distributors solve these problems. For this reason, a method is needed in compiling a mathematical model appropriate to the distribution problem. The methods used in the study are Vogel's Approximation Method (VAM), Improved Vogel's Approximation Method (IVAM), Max-Min Vogel's Approximation Method (MM-VAM), and Modified Vogel's Approximation Method (MVAM). Based on the results of the study, Vogel's Approximation Method generates total cost different initial solutions. Vogel's Approximation Method is more efficient, as it has few iterations to obtain the optimal solution using the stepping stone method. Distributors can consider the use of Vogel's Approximation Method in optimizing the distribution costs of drinking water from Sikumbang Kampar Springs. Total distribution transportation costs Sikumbang Kampar Springs per week uses transportation model is Rp 4,580,485.00. This result is more optimal for transportation costs distributor, that is Rp 5.050.000.000,00, so there is a reduction in transportation for Rp 469,515.00.
Penerapan Mixed Integer Programming dalam Pengoptimalan Keuntungan pada D’Laundry Factory Pekanbaru Elfira Safitri; Sri Basriati; Khotimah Khotimah; Mohammad Soleh; Retno Ayu Puji Lestari; Nilwan Andiraja
Jurnal Sains Matematika dan Statistika Vol 9, No 1 (2023): JSMS Januari 2023
Publisher : Universitas Islam Negeri Sultan Syarif Kasim Riau

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24014/jsms.v9i1.19755

Abstract

D’Laundry Factory is one of the businesses engaged in washing and ironing services. The problem that is often faced by laundry business owner is determining the amount of laundry items received by D’Laundry Factory to optimize maximum profits. The purpose of this study was to determine the combination of the number of laundry items received by the D’Laundry Factory to optimize profits using Mixed Integer Programming. The method used in this research is the Branch and Bound method. Based on the results of the study obtained that the DLaundry Factory Pekanbaru business received blanket 70 kg, bedcover 750 kg, dolls 20 kg, shoes 90 kg, bags 17,5 kg, helmets 30 kg, strollers 511 kg, curtains 200 kg, clothes 325.4 kg with a maximum profit of Rp.15.745.850.
Optimal Control of Vaccination for Dengue Fever in SIR Model Nilwan Andiraja; Sri Basriati; Elfira Safitri; Rahmadeni Rahmadeni; A Martino
KUBIK Vol 7, No 2 (2022): KUBIK: Jurnal Publikasi Ilmiah Matematika
Publisher : Jurusan Matematika, Fakultas Sains dan Teknologi, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/kubik.v7i2.21397

Abstract

According to data from The Indonesian ministry of health, many of individuals suffere dengue fever until may 2023 in Indonesia. To reduce its cases, in this article, a single of control strategy of vaccination for infected human by dengue fever has been proposed. To obtain the optimal control, the SIR model has been modificated with single control and the new objective function has been made before the Pontryagin minimum principle is used in this article. According to the differential equation in the model of the dengue fever and the objective function, we made the Hamiltonian equation. Then, from it, the state equation, costate equation, and stationary condition has been made from the Hamiltonian equation so we obtained the optimal control in vaccination. In the end of this article, we did the numerical simulation using the sweep forward-backward method. Through numerical simulation, we find that the control succeed to reduce the infected human by dengue fever and also increase human recovery from this desease. Futhermore, the control of vaccination for infected human should be implemented not only in this mathematical model but also into real life to decrease the dengue fever case. 
Optimal Control of Vaccination for Dengue Fever in SIR Model Nilwan Andiraja; Sri Basriati; Elfira Safitri; Rahmadeni Rahmadeni; Alfitra Martino
KUBIK Vol 7, No 2 (2022): KUBIK: Jurnal Publikasi Ilmiah Matematika
Publisher : Jurusan Matematika, Fakultas Sains dan Teknologi, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/kubik.v7i2.21397

Abstract

According to data from The Indonesian ministry of health, many of individuals suffere dengue fever until may 2023 in Indonesia. To reduce its cases, in this article, a single of control strategy of vaccination for infected human by dengue fever has been proposed. To obtain the optimal control, the SIR model has been modificated with single control and the new objective function has been made before the Pontryagin minimum principle is used in this article. According to the differential equation in the model of the dengue fever and the objective function, we made the Hamiltonian equation. Then, from it, the state equation, costate equation, and stationary condition has been made from the Hamiltonian equation so we obtained the optimal control in vaccination. In the end of this article, we did the numerical simulation using the sweep forward-backward method. Through numerical simulation, we find that the control succeed to reduce the infected human by dengue fever and also increase human recovery from this desease. Futhermore, the control of vaccination for infected human should be implemented not only in this mathematical model but also into real life to decrease the dengue fever case. 
PENERAPAN PENUGASAN MULTI-OBJECTIVE UNTUK MENGOPTIMALKAN BIAYA, WAKTU DAN KUALITAS MENGGUNAKAN METODE HUNGARIAN Sri Basriati; Elfira Safitri; Muhammad Rizki
MAp (Mathematics and Applications) Journal Vol 5, No 1 (2023)
Publisher : Universitas Islam Negeri Imam Bonjol Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15548/map.v5i1.6118

Abstract

Various problems be facing by the company to get optimal results. One of them in this research is to optimize cost, time and quality simultaneous to get a minimal solution. The optimization of these problems uses the Hungarian method by applying multi-objective assignments. Based on the of the optimal solution results from one-objective, two-objective and three-objective assignments, these third-objective assignment is the best result. So that in the case example, the optimal solution is obtaining where the total cost incurred is Rp. 24,950,000. The total time required is 96 days. While the quality of the rattan flower vase is very good, the decorative lighting is very good and the mat is very good, the shelf is very good, the table is very good, the wardrobe is very good and the guest chair is very good.
KOMBINASI ALGORITMA BRANCH AND BOUND DAN CHEAPEST INSERTION HEURISTIC DALAM MENGOPTIMALKAN RUTE DISTRIBUSI KURIR PAKET JNT DI KECAMATAN BATANG CENAKU Elfira Safitri; Sri Basriati; Winda Widiarti; Sri Sukmawati
Jurnal Lebesgue : Jurnal Ilmiah Pendidikan Matematika, Matematika dan Statistika Vol. 5 No. 1 (2024): Jurnal Lebesgue : Jurnal Ilmiah Pendidikan Matematika, Matematika dan Statistik
Publisher : LPPM Universitas Bina Bangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.46306/lb.v5i1.472

Abstract

Traveling Salesman Problem (TSP) is a problem faced by salesmen who only visit each city once and then return to their hometown with the shortest distance. The aim of this research is to determine the shortest route for the distribution journey of JNT package couriers.The method used in this research is a combination of the Branch and Bound Algorithm and the Cheapest Insertion Heuristic. Data analysis was carried out by interpreting the problem in graph form, next use the Googling application to search and determine distances. Based on the research results, it was found that the shortest route for JNT package courier distribution District is JNT Belilas → Kuala Kilan → Bukit Lipai → Aur Cina → Pejangki → Petaling Jaya → Puntianai → Lahai → Talang Mulya → Talang Bersemi → Anak Talang → Kepayang sari → Alim 2 → Sipang → Alim 1 → Batu Papan → Cenaku Kecil → Pematang Manggis → Kerubung Jaya → Bukit Lingkar → Bukit Indah → Kuala Gading → JNT Belilas with total distance 172 km
COMPUTATION OF NATURAL CONVECTION IN A POROUS PARALLELOGRAMMIC ENCLOSURE WITH A MAGNETIC FIELD Saleh, Habibis; Basriati, Sri; Hashim, Ishak
Makara Journal of Science Vol. 14, No. 2
Publisher : UI Scholars Hub

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Detailed numerical calculations are presented in this paper for natural convection in a porous parallelogrammic enclosure with a magnetic field. The inclined walls are maintained isothermally at different temperatures. The top and bottom horizontal straight walls are kept adiabatic. To simplify the effort in matching the grid mesh with the inclined walls of the parallelogrammic region/geometry, the computational domain is mapped onto a rectangular shape using a non-linear axis transformation. Transport equations are modeled by a stream-vorticity formulation then expressed in the new coordinate system and solved numerically by a finite difference method. Based upon the numerical predictions, we found the convection modes within the enclosure depended upon the Rayleigh number and the inclination angle. As the value of magnetic field is made larger, the strength of the heat transfer is progressively suppressed. Tuning the inclination angle decreases the heat transfer performance.
PENERAPAN METODE REDUKSI VARIABEL DALAM PENGOTIMALAN PENDAPATAN MINIMUM HASIL PRODUKSI BINGKAI FOTO Safitri, Elfira; Basriati, Sri; Oktavia, Dhea Rizki; Soleh, Mohammad
MAp (Mathematics and Applications) Journal Vol 6, No 1 (2024)
Publisher : Universitas Islam Negeri Imam Bonjol Padang

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

Abstract

Production is an activity that produces an object so that it is more useful in meeting needs. One shop that produces photo frame of various sizes is Terminal Photo Giant. The aim of this research is to determine the minimum income per day from photo frame production using the variable reduction method. The method used in this research is the variable reduction method. The variable reduction method produces an optimal solution with all decision variables in the form of integers without having to branch or add gomory constraints. Based on the result of research using the variable reduction method, Giant Photo Terminal produces a minimum of 4 units of 16 R size photo frames and a minimum of 3 units of 18 R size photo frames every day with a minimum daily income of IDR. 570.000.
Co-Authors -, Yuhandi - A Martino Ade Novia Rahma Afri Melda ahmad faizal Alfaizan Darman Alfitra Martino Amelia Zahara Andini, Chania Tri Anggraini, Resi Ayu - Octariana Ayu Lestari Clara Ramadhania Corry Corazon Marzuki Debby Cahyani Dewi Sartika Dian Mursyitah Dina Aziza Elfira Safitri Elvina Andiani Ervi Helen Sukma Eva Santi Fitri Aryani Habibis Saleh Hashim, Ishak Hasyratul Najmi Ishak Hashim Ishak Hashim Jumiyatun, Jumiyatun Khotimah Khotimah Kisty, Teshi Amelia Hakilla Latifah Hanum Meli Ermanita Mexdika, Raja Putra Mohammad - Soleh Mohammad Soleh Mohammad Soleh Mohammad Soleh Muhammad Rizki muhammad soleh muhammad soleh Mulyani, Septia Nikmatul Aufa Nilwan Andiraja Nilwan Andiraja Nilwan Andiraja Novi Andriani, Novi Nur Azizah Br Barus Nur Ulfa Nuraisyah, Puteri Nurul Izzah Nusantoro, Dinda Kurniyawan Oktavia, Dhea Rizki Putri Ayu Lestari Rahma, Adlul Finy Rahmadeni Rahmadeni Rahmawati Rahmi Yatul Husna M Rahmi, Nafia Resi Anggraini Resti Molina Resti Riafani Retno Ayu Puji Lestari Rini Eka Putri Rini Erawati Rio Sunarya Riska Armeliza Riska Wulandari Safitri, Elfira - Sari, Kiki Indah She Arssy Yesti Soleh, Mohammad - Spastika, Galuh Mreta Sri Sukmawati Sri Wahyuni Syafrika Yuliarti Tengku, Tengku Reza Suka Alaqsa Wazna Ulya Wina Yustari Winda Widiarti Yuhandi - - Yulanda, Rahmi Yuslenita Muda Zukrianto, Zukrianto Zulfatri Aini