Article Per Year (5 Year)
p-Index From 2020 - 2025
0.444
P-Index
This Author published in this journals
All Journal Integra: Journal of Integrated Mathematics and Computer Science
Nurfabella, Rehsya
Unknown Affiliation
Computer Science & IT Mathematics

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

Found 2 Documents
Search

 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.
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.
Co-Authors Hadi, Nur Wafiqoh Mustika, Mira Notiragayu Siti Laelatul Chasanah, Siti Laelatul Wamiliana