Article Per Year (5 Year)
p-Index From 2020 - 2025
1.497
P-Index
This Author published in this journals
All Journal Desimal: Jurnal Matematika Jurnal Pengabdian Kepada Masyarakat (JPKM) Tabikpun Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi MATHunesa: Jurnal Ilmiah Matematika Integra: Journal of Integrated Mathematics and Computer Science
Siti Laelatul Chasanah, Siti Laelatul
Unknown Affiliation
Chemical Engineering, Chemistry & Bioengineering Chemistry Computer Science & IT Education Health Professions Mathematics Social Sciences

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

Found 5 Documents
Search
Journal : Integra: Journal of Integrated Mathematics and Computer Science

 1 
Solving the Traveling Salesman Problem on a Directed Graph Using Greedy Algorithm (Case Study: Locations of BRI Bank in Bandar Lampung City) Nurfabella, Rehsya; Chasanah, Siti Laelatul; Notiragayu
Integra: Journal of Integrated Mathematics and Computer Science Vol. 1 No. 1 (2024): March
Publisher : Magister Program of Mathematics, Universitas Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26554/integrajimcs.2024117

Abstract

The traveling salesman problem is the idea that a salesman must discover the shortest path between an origin point and many destination points, returning to the origin point after visiting the destination point once. In this study, the Greedy Algorithm will be used to solve the Traveling Salesman Problem on a directed graph which represented BRI Banks in Bandar Lampung city. The locations of the banks are represented by points, while the journey time between BRI Banks is represented by lines. According to the results, 130 minutes was the same amount of time spent manually and with the Python software.
Implementation of Christofides Algorithm to Determine the Shortest Tour of Some Hospitals in Palembang City Putri, Dwi Rizka Amelia; Oktavia, Niken Sabella; Chasanah, Siti Laelatul; Sawitri, Riza; Paskalia, Felicia Andrade
Integra: Journal of Integrated Mathematics and Computer Science Vol. 2 No. 1 (2025): March
Publisher : Magister Program of Mathematics, Universitas Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26554/integrajimcs.20252113

Abstract

Determining the shortest route to connect hospitals is a very important aspect of improving the efficiency of medical service distribution in a big city like Palembang. The shortest tour will result in a shorter time required. This study aims to minimize the time needed for a team of technicians who want to distribute medical equipment and provide simple usage examples to some hospitals in Palembang city. There are 20 hospitals under consideration, and the data on time needed from one hospital to another were obtained from Google Maps. The distance between locations was calculated based on travel time using a four-wheeled vehicle. The Christofides Algorithm will be used in this  problem to determine the shortest tour. The results show that the travel time needed is 171 minutes (only for traveling from one hospital to another and back to the origin, not including the time needed for giving the simple usage of medical equipment). This study provides practical solutions to improve time efficiency, such as delivering medical supplies or emergency response.
The Use of Dijkstra's Algorithm in Determining the Shortest Path of Expedition in Bandarlampung Assiva, Adelia; Puspita, Resta Meyliana; Sihombing, Riska Romauli; Chasanah, Siti Laelatul; Mustika, Mira
Integra: Journal of Integrated Mathematics and Computer Science Vol. 1 No. 3 (2024): November
Publisher : Magister Program of Mathematics, Universitas Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26554/integrajimcs.20241323

Abstract

Delivery of goods is a problem faced by freight forwarders/expedition companies. Determining an efficient route will determine the speed and cost of delivery. This is faced by most expedition companies, including one of the expedition companies in the city of Bandarlampung, namely the J&T Express expedition. There are 20 J&T Express branches in Bandarlampung city. If someone wants to send an item but one of the branches is closed or not available then he will try to determine the next closest branch. In this study, the shortest path from J&T on Pagar Alam to 19 other branches in Bandarlampung will be determined using Dijkstra’s Algorithm.
Multidimensional Log-Linear Modeling (Case Study: Gender, Age, Head Circumference, and Nutritional Status Among Early Childhood Children) Yoka, Ranara Athalla; Usman, Mustofa; Chasanah, Siti Laelatul; Widiarti; Handayani, Vitri Aprilla
Integra: Journal of Integrated Mathematics and Computer Science Vol. 2 No. 2 (2025): July
Publisher : Magister Program of Mathematics, Universitas Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26554/integrajimcs.20252228

Abstract

Poor nutritional status tends to increase the risk of morbidity and mortality among children in developing countries. Therefore, data on these rates can be an important indicator in describing the condition of undernutrition in a community. Log-linear model analysis can be used to categorize data on nutritional status. Based on data obtained from the Rajabasa Indah Health Center area, Rajabasa Subdistrict, Bandar Lampung City, there are 418 children who have examined at the Posyandu. The analysis model conducted in this study involves four variables, each variable is categorized into several categories according to predetermined criteria. Gender with two categories (male and female), age with two categories (1-12 months and 13-60 months), head circumference with two categories (normal and abnormal), and nutritional status with three categories (undernourished, well-nourished, and overnourished). This study aims to determine the best model using log-linear analysis that can explain the relationship between the four variables. The results obtained are the best model for the data involved in the [UG][LG][J] structure, the structure describes the interaction between age and nutritional status and head circumference and nutritional status.
Jordan Derivation on the Polynomial Ring R[x] Sitompul, Desi Elena; Fitriani; Chasanah, Siti Laelatul; Faisol, Ahmad
Integra: Journal of Integrated Mathematics and Computer Science Vol. 2 No. 2 (2025): July
Publisher : Magister Program of Mathematics, Universitas Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26554/integrajimcs.20252229

Abstract

Given a ring R. An additive mapping δ: R → R is called a Jordan derivation if δ(a²) = δ(a)a + aδ(a) for every a in R. Jordan derivation is one of the special forms of derivation. In this study, we investigate the Jordan derivation on the polynomial ring R[x] and examine its properties. This study begins by constructing the Jordan derivation on the polynomial ring R[x], followed by investigating its characteristics, including the relationship between the Jordan derivation on the ring R and on the polynomial ring R[x]. In addition, several concrete examples are presented to illustrate the main results obtained. This research is expected to contribute to a deeper understanding of the properties of Jordan derivations on polynomial rings.
Co-Authors AHMAD FAISOL Assiva, Adelia Darina, Novi Dina Eka Nurvazly, Dina Eka Eri Setiawan Fitriani Handayani, Vitri Aprilla Hasanah, Arvi Ikhlas Pratama Sandy Muslim Ansori Mustika, Mira Mustofa Usman Notiragayu Nurfabella, Rehsya Nurvazly, D E Oktavia, Niken Sabella Pandri Ferdias, Pandri Paskalia, Felicia Andrade Puspita, Resta Meyliana Putri, Dwi Rizka Amelia Sawitri, Riza Sihombing, Riska Romauli Sitompul, Desi Elena Wamiliana Wamiliana Widarti, Widiarti Widiarti Yoka, Ranara Athalla