Article Per Year (5 Year)
p-Index From 2021 - 2026
0.659
P-Index
This Author published in this journals
All Journal JURNAL MEDIA INFORMATIKA BUDIDARMA JOURNAL OF INFORMATION SYSTEM RESEARCH (JOSH) Bulletin of Computer Science Research
Martini Martini
Universitas Bina Sarana Informatika, Jakarta
Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Electrical & Electronics Engineering

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

Found 3 Documents
Search

 1 
Penerapan Metode Saving Matrix Dalam Optimasi Rute Perjalanan Kunjungan Mitra Sekolah Untuk Peningkatan Strategi Marketing Kampus Nani Agustina; Martini Martini; Entin Sutinah
JURNAL MEDIA INFORMATIKA BUDIDARMA Vol 7, No 2 (2023): April 2023
Publisher : Universitas Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/mib.v7i2.5955

Abstract

Bina Sarana Informatika University has a lot of campuses, one of which is in the Jatiwaringin area. In marketing activities, UBSI has a team called Markom. One of the success factors of UBSI's marketing is determined by visits to high schools around the UBSI Jatiwaringin campus, where this activity is carried out as a form of cooperation between UBSI and the school in carrying out promotions for campus events whose target is class XII students. In carrying out campus marketing activities, UBSI Jatiwaringin has 15 target schools around the campus. In carrying out the visit, Markom had problems in determining which schools to visit first, because in carrying out campus marketing activities, Markom only provided time with a duration of 08:00-12:00 by making visits starting from the UBSI Jatiwaringin campus and returned to the UBSI Jatiwaringin campus. So it is necessary to have an optimal route pattern to determine the minimum route in the school visit process. To overcome these problems need to apply a method. In this study the Saving Matrix method was used to determine the path and distance of visits to schools with optimal visiting times. The data obtained is in the form of school names, distances, and travel routes from UBSI Jatiwarigin to the schools to be visited. From the results of data processing, it was obtained that the visit time was 6 days with 6 routes with a travel time of 233 minutes which previously did not have rules for using routes but only based on estimates and urgency which sometimes took 8 days. The results of this study indicate that by using the Saving Matrix method the time needed is more optimal because the steps taken are appropriate in solving travel route problems and easy to implement.
Optimasi Rute Distribusi Spare Part Motor Menggunakan Ant Colony Optimization untuk Efisiensi Jarak Tempuh Nani Agustina; Entin Sutinah; Martini Martini
Journal of Information System Research (JOSH) Vol 7 No 4 (2026): July 2026
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/josh.v7i4.9620

Abstract

Logistics efficiency in goods distribution has become a major challenge for distribution companies in reducing operational costs. This study aims to optimize the distribution routes of motorcycle spare parts at PD. Tri Jaya Motor using the Ant Colony Optimization (ACO) algorithm. The main issue faced by the company is the use of unsystematic manual route determination, which results in inefficient travel distances. The methodology employed in this research involves modeling the Traveling Salesman Problem (TSP) across six distribution points using parameters of alpha = 1, beta = 1, and rho = 0.1. The simulation results demonstrate that the ACO algorithm successfully identified the optimal route with a total distance of 206.6 km, resulting in significant savings compared to the initial route. This study contributes by providing a metaheuristic-based decision-making strategy for medium-scale distribution systems.
Penerapan Algoritma Decision Tree Untuk Memprediksi Pengelolaan Inventaris Sarana Pembelajaran Kampus Martini Martini; Nani Agustina; Entin Sutinah
Bulletin of Computer Science Research Vol. 6 No. 1 (2025): December 2025
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/bulletincsr.v6i1.889

Abstract

UBSI as an educational institution that has learning support facilities must be able to manage campus inventory effectively. This study aims to determine the management of asset management that needs to be done, both in the form of routine maintenance and updating of goods. The UBSI Jatiwaringin branch campus only makes reports on the condition of inventory items, so it cannot determine whether the reported inventory data is updated or repaired, so far it is not known which items are prioritized based on their level of importance. The data will then be followed up by the main campus to check the inventory data report. The method used to determine inventory predictions is the Decision Tree Algorithm which has priority, location, condition, frequency, and prediction attributes. As targets in the decision tree are prediction attributes that have maintenance or renewal classes. Determination of inventory data predictions by calculating the entropy, gain, gain info, and gain ratio values ??of each attribute and resulting in the Priority attribute being the root node in the formed decision tree. This indicates that the priority attribute has a strong influence in determining whether an item is included in the maintenance or renewal class. Based on testing results using RapidMiner software with the K-Fold Cross Validation method, the Decision Tree algorithm can generate a decision model with an average accuracy of 86.67% in campus inventory management. The results of this study are expected to be useful for Jatiwaringin Campus administrators to conduct initial inspections without waiting for repairs from the main campus.
Co-Authors Entin Sutinah, Entin Nani Agustina