Article Per Year (5 Year)
p-Index From 2020 - 2025
0.61
P-Index
This Author published in this journals
All Journal Square : Journal of Mathematics and Mathematics Education Journal of Mathematics, Computation and Statistics (JMATHCOS)
Oeitama, Whennie Youngger
Unknown Affiliation
Education Mathematics

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

Found 3 Documents
Search

 1 
Optimasi Rute Pendistribusian Barang Menggunakan Kombinasi Algoritma Branch and Bound dan Cheapest Insertion Heuristic Oeitama, Whennie Youngger; Oeitama, Whannie Youngger; Sitandi, Flora Frisilia; Mas'ud, Syamsuddin
Square : Journal of Mathematics and Mathematics Education Vol. 6 No. 2 (2024)
Publisher : UIN Walisongo Semarang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21580/square.2024.6.2.22992

Abstract

The problem that often occurs in the process of distributing goods is that the distribution route is not optimal which results in higher costs and longer travel times. This can be solved by finding the shortest path that can be passed or widely recognized as the Traveling Salesman Problem (TSP). This study aims to determine the optimal distribution route for goods using a combination of the Branch and Bound and Cheapest Insertion Heuristic algorithms. The data used are in the form of location names and distances between locations that have been collected by Putra BJ Bangun in his research entitled Solving the Traveling Salesman Problem (TSP) with the Branch and Bound Method (Application of the Palembang Post Office Goods Transportation Problem). The results of the research indicate that the optimal route for the distribution of goods at the Palembang City Post Office, using a combination of both algorithms, is: KPRK Palembang → KPC Kapt A. Rivai → KPC Pakjo → KPC Talang Ratu → KPC Sukarami → KPC Alang Lebar → KPC Sekip → KPC Cinde → KPRK Palembang, spanning a total of 24.3 km. This route can be an alternative for salesmen to visit several KPCs and return to KPRK, with more efficient costs and time because it is the shortest route. In addition, this combination of algorithms is more efficient and simpler in terms of processing steps and computing time compared to using the Branch and Bound algorithm.Keywords: Traveling Salesman Problem (TSP), Branch and Bound, Cheapest Insertion Heuristic, Algorithm Combination, Optimal.
Mathematics and Culture: Affine Transformation Representation of Atakkae Traditional House in Wajo Regency Using Blender Software Ja’faruddin, Ja’faruddin; Chen, Wen Haw; Oeitama, Whennie Youngger; Padasasih, Andi Ismudiah; Wijayana, Widhi Kesawa; Murnianti, Murnianti; Rahman, Nurul Qalbi; Utami, Indah Tri Wira
Journal of Mathematics, Computations and Statistics Vol. 8 No. 1 (2025): Volume 08 Nomor 01 (April 2025)
Publisher : Jurusan Matematika FMIPA UNM

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35580/jmathcos.v8i1.7843

Abstract

This study examines the application of affine transformations to the geometric structure of the Atakkae traditional house in Wajo Regency, South Sulawesi, in the context of ethnomathematics. This traditional house, known as Saoraja La Tenri Bali, is a typical Bugis stilt house with architectural uniqueness in the form of 101 pillars and large dimensions. Affine transformations were used to analyze the geometric elements of this traditional house, including scale, rotation and shear, in order to understand the mathematical relationships in traditional design. This research used a descriptive qualitative approach with data collected through direct observation and literature review. Geometric visualization was conducted using Blender software, which utilizes matrix transformation to model the structure of the traditional house in detail. The results show that the geometric elements in Atakkae traditional houses reflect a combination of local wisdom and mathematical principles, which are relevant in preserving culture while providing new insights into the relationship between mathematics and tradition. The findings are expected to contribute to the documentation of cultural heritage and the development of ethnomathematics learning.
Optimasi Rute Pendistribusian Barang Menggunakan Kombinasi Algoritma Branch and Bound dan Cheapest Insertion Heuristic Oeitama, Whennie Youngger; Oeitama, Whannie Youngger; Sitandi, Flora Frisilia; Mas'ud, Syamsuddin
Square : Journal of Mathematics and Mathematics Education Vol. 6 No. 2 (2024)
Publisher : UIN Walisongo Semarang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21580/square.2024.6.2.22992

Abstract

The problem that often occurs in the process of distributing goods is that the distribution route is not optimal which results in higher costs and longer travel times. This can be solved by finding the shortest path that can be passed or widely recognized as the Traveling Salesman Problem (TSP). This study aims to determine the optimal distribution route for goods using a combination of the Branch and Bound and Cheapest Insertion Heuristic algorithms. The data used are in the form of location names and distances between locations that have been collected by Putra BJ Bangun in his research entitled Solving the Traveling Salesman Problem (TSP) with the Branch and Bound Method (Application of the Palembang Post Office Goods Transportation Problem). The results of the research indicate that the optimal route for the distribution of goods at the Palembang City Post Office, using a combination of both algorithms, is: KPRK Palembang → KPC Kapt A. Rivai → KPC Pakjo → KPC Talang Ratu → KPC Sukarami → KPC Alang Lebar → KPC Sekip → KPC Cinde → KPRK Palembang, spanning a total of 24.3 km. This route can be an alternative for salesmen to visit several KPCs and return to KPRK, with more efficient costs and time because it is the shortest route. In addition, this combination of algorithms is more efficient and simpler in terms of processing steps and computing time compared to using the Branch and Bound algorithm.Keywords: Traveling Salesman Problem (TSP), Branch and Bound, Cheapest Insertion Heuristic, Algorithm Combination, Optimal.
Co-Authors Chen, Wen Haw Ja’faruddin, Ja’faruddin Murnianti, Murnianti Oeitama, Whannie Youngger Padasasih, Andi Ismudiah Rahman, Nurul Qalbi Sitandi, Flora Frisilia Syamsuddin Mas'ud Utami, Indah Tri Wira Wijayana, Widhi Kesawa