Article Per Year (5 Year)
p-Index From 2020 - 2025
0.835
P-Index
This Author published in this journals
All Journal Jurnal Inotera Journal of Mathematics Education and Science MATHunesa: Jurnal Ilmiah Matematika JMT (Jurnal Matematika dan Terapan)
Desi Febriani Putri
Unknown Affiliation
Computer Science & IT Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Engineering Industrial & Manufacturing Engineering Materials Science & Nanotechnology Mathematics Mechanical Engineering

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

Found 5 Documents
Search

 1 
Aplikasi Pemrograman Linear Integer Pada Optimasi Keuntungan Produksi Olahan Beras Ketan di Industri Rumah Tangga Desa Long Pejeng Rosi; Syaripuddin; Desi Febriani Putri
Jurnal Inotera Vol. 10 No. 1 (2025): January-June 2025
Publisher : LPPM Politeknik Aceh Selatan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31572/inotera.Vol10.Iss1.2025.ID484

Abstract

Glutinous rice is a variety of rice that plays an important role in local culture, especially in the tradition of opening fields. When the harvest season arrives, local communities usually hold thanksgiving in the form of uman (eating) ubek parties at the beginning of the harvest and post-harvest parties as an expression of gratitude for the harvest. In the tradition of the Dayak community, especially Dayak Kenyah, glutinous rice is used as the main ingredient for making various specialties such as lemang, ubek (kenta), and undat ao. So glutinous rice is used as the main commodity for the household industry in Long Pejeng Village. Various types of processed products produced by this industry, including lemang, fried sticky rice, klepon and bubur candil, use glutinous rice as the main raw material. This study aims to optimize the profit of glutinous rice production by applying integer linear programming. The method used in this research is the simplex method to find the optimal solution, as well as the Gomory Cutting Plane method to obtain a feasible integer solution for each type of product. The results showed that the optimal production quantity was 281 packs per one-time production, consisting of 112 packs of lemang, 56 packs of fried sticky rice, 45 packs of klepon, and 68 packs of candil porridge, with a maximum profit of Rp887,368.00. Optimization using this method is proven to significantly increase profits by 14.4% compared to the previous production method and increase efficiency in the use of raw materials and production capacity
PENERAPAN ALGORITMA BRANCH AND BOUND UNTUK OPTIMASI RUTE WISATA DI KALIMANTAN TIMUR BERDASARKAN TRAVELING SALESMAN PROBLEM Pasia Rande; Stefania Sesilia G. Witin; Welly Dona Permatasari; Nur Aminah; Fidia Deny Tisna Amijaya; Desi Febriani Putri
MATHunesa: Jurnal Ilmiah Matematika Vol. 13 No. 2 (2025)
Publisher : Universitas Negeri Surabaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Kalimantan Timur merupakan daerah yang memiliki potensi wisata tinggi, terutama dengan adanya pembangunan Ibu Kota Nusantara (IKN). Untuk mendukung efisiensi kunjungan wisata, dibutuhkan rute perjalanan yang optimal agar waktu dan biaya yang digunakan dapat diminimalkan. Penelitian ini membahas penerapan algoritma Branch and Bound dalam menyelesaikan permasalahan Travelling Salesman Problem (TSP) guna menentukan rute wisata terpendek di Kalimantan Timur. Algoritma ini bekerja dengan prinsip pencabangan dan pembatasan untuk mengevaluasi semua kemungkinan jalur, lalu memilih solusi dengan jarak tempuh minimum. Data jarak antar lokasi wisata diperoleh dari Google Maps, kemudian dimodelkan dalam bentuk graf berbobot tak berarah. Dari hasil penelitian ini diperoleh rute terpendeknya adalah Bandara Sepinggan Balikpapan, Hutan Mangrove Margomulyo, Pantai Melaw, Samboja Lodge, Bukit Bingkirai, Batu Dinding Long Melaha, Taman Ekologis Anang Hasyim, Bandara Sepinggan Balikpapan dengan total jarak tempuh km.
Implementasi Algoritma Ant Colony Optimization untuk Menentukan Rute Terpendek Tempat Populer di Kota Samarinda Desi Febriani Putri; Kurniawan Noor Bilal; Fidia Deny Tisna Amijaya; Karina Putri; Dimas Raditya Sahputra
JMT (Jurnal Matematika dan Terapan) Vol. 7 No. 1 (2025): JMT (Jurnal Matematika dan Terapan)
Publisher : Mathematics Study Program, Faculty of Mathematics and Natural Science, Universitas Negeri Jakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21009/jmt.7.1.3

Abstract

Penelitian ini bertujuan untuk mengimplementasikan algoritma Ant Colony Optimization (ACO) dalam menentukan rute terpendek menuju tempat-tempat populer di Kota Samarinda. Samarinda, sebagai salah satu pusat pertumbuhan di Kalimantan Timur, menghadapi tantangan serius dalam manajemen lalu lintas akibat kepadatan dan ketidakaturan. Dengan memanfaatkan ACO, yang terinspirasi dari perilaku semut dalam mencari sumber makanan, penelitian ini berusaha memberikan solusi optimal untuk mempermudah wisatawan dalam menentukan rute terbaik menuju berbagai destinasi wisata di kota tersebut. Masalah ini dikategorikan sebagai Travelling Salesman Problem (TSP), di mana tujuan utamanya adalah menemukan rute perjalanan paling efisien yang mengunjungi setiap lokasi sekali dan kembali ke titik awal. Data koordinat lokasi diperoleh menggunakan Google Maps, yang kemudian diolah menjadi graf untuk representasi jalur. Hasil penelitian menunjukkan bahwa algoritma ACO efektif dalam menemukan rute terpendek dengan total jarak optimal sebesar 69.95 km. Implementasi ACO ini diharapkan dapat menjadi referensi bagi pengembangan sistem rute wisata yang lebih efisien di masa mendatang.
Graph Coloring on the Primary Dryland Forest Cover Map of Kalimantan Using the Greedy Algorithm Izzaty Farha; Putri Pita Mutia; Rachel Cornelia Simanjuntak; Desi Febriani Putri; Fidia Deny Tisna Amijaya
Journal of Mathematics Education and Science Vol. 8 No. 2 (2025): Journal of Mathematics Education and Science
Publisher : Universitas Nahdlatul Ulama Sunan Giri Bojonegoro

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32665/james.v8i2.4628

Abstract

In graph theory, graph coloring is a popular approach, including in map creation, and this study aims to apply the Greedy algorithm to color forest land-cover maps while ensuring that adjacent areas do not share the same color. The data used consist of land-cover classification maps and the relationships between regions represented as planar graphs. The Greedy algorithm is implemented by arranging nodes based on their highest degrees and then coloring them sequentially. The coloring results show that the algorithm can provide an efficient solution with a minimum number of colors according to the upper bound of graph coloring, particularly for primary dry forest land-cover maps in East Kalimantan Province, achieving a chromatic number χ(G) = 4, ensuring no neighboring areas share the same color. Although it does not always yield an optimal solution, the algorithm proves effective, simple, and applicable to various other uses such as spatial analysis, regional clustering, or geographic information systems. The novelty of this study lies in its application to primary dry forests in Kalimantan, which have been rarely explored, and its contribution to spatial analysis and conservation efforts.
On Local Vertex Antimagic Total Coloring Of Path, Cycle, And Star Graphs With Comb Operation Taradita Ayitia Meisya Fendina; Desi Febriani Putri; Wasono; Maria Alensia Deltin Dala
Journal of Mathematics Education and Science Vol. 8 No. 2 (2025): Journal of Mathematics Education and Science
Publisher : Universitas Nahdlatul Ulama Sunan Giri Bojonegoro

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32665/james.v8i2.4777

Abstract

Let G(V,E) be a graph consisting of a set of vertices V(G) and a set of edges E(G) where the number of vertices and edges are denoted by |V(G)| and |E(G)|, respectively. A bijective function f:V(G) \vee E(G) \to {1,2,3,...,(|V(G)|+|E(G)|)} is defined as a local vertex antimagic total coloring if there exist two adjacent vertex vx and vy with . Therefore, every local vertex antimagic total coloring produces a vertex coloring of the graph G, where each vertex v is assigned a color corresponding to its weight w(v). This research is essential as it contributes to development of graph coloring theory, particularly in the area of local vertex antimagic total coloring, which has been rarely studied. This research discusses the local vertex antimagic total coloring of and  which aims to determine the chromatic number. The result of the research is the chromatic number of local vertex antimagic total coloring of  and the chromatic number of local vertex antimagic total coloring , is if  is odd and  if  is even.
Co-Authors Dimas Raditya Sahputra Fidia Deny Tisna Amijaya Izzaty Farha Karina Putri Kurniawan Noor Bilal Maria Alensia Deltin Dala Nur Aminah Pasia Rande Putri Pita Mutia Rachel Cornelia Simanjuntak Rosi Stefania Sesilia G. Witin Syaripuddin Taradita Ayitia Meisya Fendina Wasono Welly Dona Permatasari