Article Per Year (5 Year)
p-Index From 2021 - 2026
0.408
P-Index
This Author published in this journals
All Journal Indonesian Journal of Combinatorics Integra: Journal of Integrated Mathematics and Computer Science
Hadi, Nur Wafiqoh
Unknown Affiliation
Computer Science & IT Decision Sciences, Operations Research & Management Mathematics

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

Found 2 Documents
Search

 1 
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.
The partition dimension of origami graphs and its barbell Fakhira, Luthfia Ayu; Hadi, Nur Wafiqoh; Asmiati, A.; Nurvazly, Dina Eka
Indonesian Journal of Combinatorics Vol 9, No 2 (2025)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2025.9.2.4

Abstract

The origami graph, On, n≥3, is a graph formed by a central cycle with origami folds, where each fold consists of two C3 cycles. The barbell origami graph, BOn for n≥3 is obtained by copying a On and connecting two graphs with a bridge. In this research, we determined the partition dimension of the origami graphs and its barbell.
Co-Authors Asmiati, A. Dina Eka Nurvazly, Dina Eka Fakhira, Luthfia Ayu Mustika, Mira Nurfabella, Rehsya Wamiliana