Article Per Year (5 Year)
p-Index From 2021 - 2026
0.888
P-Index
This Author published in this journals
All Journal Indonesian Journal of Applied Mathematics TeknoKreatif: Jurnal Pengabdian kepada Masyarakat Integra: Journal of Integrated Mathematics and Computer Science
Mustika, Mira
Unknown Affiliation
Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Mathematics Physics Other

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

Found 2 Documents
Search
Journal : Integra: Journal of Integrated Mathematics and Computer Science

 1 
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.
Co-Authors Assiva, Adelia Eristia Arfi Hadi, Nur Wafiqoh Muliawati Noor, Dear Michiko Mutiara Nurfabella, Rehsya Puspita, Resta Meyliana Retno Anggraini Sihombing, Riska Romauli Sitanggang, Nelita Anggraini Siti Laelatul Chasanah, Siti Laelatul Wamiliana