Claim Missing Document
Check
Articles

Found 4 Documents
Search

Pelatihan Tes Potensi Skolastik (TPS) di SMA Al Huda Jati Agung, Lampung Selatan Mustika, Mira; Noor, Dear Michiko Mutiara; Arfi, Eristia; Muliawati, Triyana; Anggraini, Retno
TeknoKreatif: Jurnal Pengabdian kepada Masyarakat Vol 3 No 1 (2023): TEKNOKREATIF : Jurnal Pengabdian kepada Masyarakat
Publisher : Lembaga Penelitian dan Pengabdian Kepada Masyarakat (LP2M), Institut Teknologi Sumatera, Lampung, Indonesia.

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35472/teknokreatif.v3i1.776

Abstract

Salah satu permasalahan calon mahasiswa yang mengikuti Ujian Tulis Berbasis Komputer (UTBK) yakni dihadapkan pada soal tes potensi skolastik (TPS) yang secara khusus tidak dipelajari selama sekolah. TPS merupakan ukuran referensi standar yang menggabungkan komponen kemampuan dan kecepatan. Hal ini pula yang dirasakan oleh siswa-siswa SMA Al Huda Jati Agung, Lampung Selatan. Di sisi lain, soal TPS memberikan kontribusi yang relatif besar dalam UTBK. Oleh sebab itu, diperlukan pelatihan TPS sebagai bentuk pengabdian masyarakat untuk meningkatkan kemampuan siswa dalam penalaran dan kemampuan umum lainnya. Pelatihan TPS dilaksanakan secara luring, sebanyak tiga kali. Dari evaluasi akhir, hasil pelatihan tes potensi skolastik (TPS) di SMA Al Huda Jati Agung yakni terjadi peningkatan jumlah siswa yang berhasil menjawab benar dibandingkan sebelum diberikan pelatihan.
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.
Comparative Analysis of CIH and Christofides Algorithms for Optimal Tourist Route Planning in West Java Hadi, Nur Wafiqoh; Nurfabella, Rehsya; Wamiliana; Mustika, Mira
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.20252231

Abstract

Efficient route planning plays a crucial role in supporting tourism development, particularly in regions with numerous scattered attractions such as West Java, Indonesia. This study addresses the Traveling Salesman Problem (TSP) by comparing two algorithmic approaches: the Cheapest Insertion Heuristic (CIH) and the Christofides algorithm, to determine the shortest tour among 20 selected tourist sites. Using travel time data obtained from Google Maps, both algorithms were implemented manually and using Python language programming. The manual application of the CIH algorithm resulted in a total travel time of 813 minutes, which was later optimized to 764 minutes after adjustments to eliminate intersecting paths. Meanwhile, the CIH algorithm implemented in Python provided a final route of 717 minutes. In contrast, the Christofides algorithm yielded consistent results for both manual and Python-based calculations, producing a tour with a total travel time of 746 minutes. The findings suggest that the CIH algorithm using Python language offers the most efficient route in this case study. This research contributes to the development of intelligent tour planning systems and can be a valuable reference for optimizing regional tourism logistics.
Penerapan Program Linear Fuzzy dalam Optimalisasi Jumlah Produksi dan Keuntungan di K-Bakery Sitanggang, Nelita Anggraini; Mustika, Mira
Indonesian Journal of Applied Mathematics Vol. 1 No. 2 (2021): Indonesian Journal of Applied Mathematics Vol. 1 No. 2 April Chapter
Publisher : Lembaga Penelitian dan Pengabdian Masyarakat (LPPM), Institut Teknologi Sumatera, Lampung Selatan, Lampung, Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35472/indojam.v1i2.348

Abstract

K-Bakery is a bakery located in Bandar Lampung City, Lampung. K-Bakery produces various types of bread, namely brown bread, nuts, greentea, mocha, and tiramisu bread which involve various raw material resources. Unstable market demand creates obstacles for K-Bakery in formulating the number of each type of bread to be produced so as to produce maximum profit. However, in determining the amount of production must pay attention to the limited supply of raw materials. In this case, there is a need for production planning so that all available resources can be used optimally and produce a combination of production that provides maximum profit. One way to solve this problem is to optimize production using a fuzzy linear program with a tolerance of 10% as the capability of K-Bakery. The use of the fuzzy linear program generates greater profits than the usual linear program, the profit obtained is Rp. 11.247.972,1708by producing 320 chocolate breads, 449,75 peanut breads, 365,667 greentea breads, 250 moka breads fruit, 449,925 srikaya bread, and 499,975 tiramisu breads. In addition, the value of l = 0,5 is obtained, or in other words, the maximum addition of each raw material is 50% of the available safety stock.