Article Per Year (5 Year)
p-Index From 2021 - 2026
1.235
P-Index
This Author published in this journals
All Journal JSI: Jurnal Sistem Informasi (E-Journal) SWARNA Integra: Journal of Integrated Mathematics and Computer Science Limits: Journal of Mathematics and Its Applications Nemui Nyimah
Notiragayu
Unknown Affiliation
Religion Agriculture, Biological Sciences & Forestry Humanities Computer Science & IT Decision Sciences, Operations Research & Management Engineering Environmental Science Languange, Linguistic, Communication & Media Law, Crime, Criminology & Criminal Justice Library & Information Science Mathematics Other

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

Found 2 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.
The Comparison of the Nearest Neighbor and Modified Sollin Algorithms for Determining the Shortest Tour for BNI Bank Branches in Lampung Province Maharani, Assyfa Dwipa; Putri, Desiana; Sapitri, Nonik Mega; Notiragayu; Ansori, Muslim
Integra: Journal of Integrated Mathematics and Computer Science Vol. 2 No. 3 (2025): November
Publisher : Magister Program of Mathematics, Universitas Lampung

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

Abstract

BNI is one of the government -owned banks in Indonesia. At certain times, BNI experiences a significant increase in the number of customers, which can lead to long queues. In such situations, customers generally consider visiting other BNI branches. To optimize time and cost, it is necessary to have information to determine the shortest tour between BNI locations in Lampung Province. The purpose of this study is to determine the shortest tour among 21 BNI locations in Lampung Province. The results show that both the Nearest Neighbor Heuristic Algorithm and the Modified Sollin’s Algorithm produce the same solution for Euclidean distance data and Haversine distance data. However, for time-based data, the Modified Sollin’s Algorithm performs better than the Nearest Neighbor Heuristic Algorithm.
Co-Authors Ahmad Ari Aldino Asmiati Desiana Putri Dian Kurniasari Humairosi, Lutfia La Zakaria Maharani, Assyfa Dwipa Muslim Anshori Muslim Ansori Nurfabella, Rehsya Okzarima, Wenty Putri, Amelia Fallizia Sapitri, Nonik Mega Siti Laelatul Chasanah, Siti Laelatul Suciati, Indah Wamiliana Warsono Widiarti