Article Per Year (5 Year)
p-Index From 2020 - 2025
3.057
P-Index
This Author published in this journals
All Journal M A T H L I N E : Jurnal Matematika dan Pendidikan Matematika JURNAL Al-AZHAR INDONESIA SERI SAINS DAN TEKNOLOGI IJAIT (International Journal of Applied Information Technology) Jurnal Ilmiah Matematika dan Pendidikan Matematika (JMP) Majalah Ilmiah Matematika dan Statistika (MIMS) Operations Research: International Conference Series International Journal of Quantitative Research and Modeling Jurnal Matematika Integratif AMMA : Jurnal Pengabdian Masyarakat
Siti Rahmah Nurshiami, Siti Rahmah
Jurusan Matematika FMIPA Universitas Jenderal Soedirman
Humanities Biochemistry, Genetics & Molecular Biology Chemistry Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Electrical & Electronics Engineering Engineering Environmental Science Industrial & Manufacturing Engineering Law, Crime, Criminology & Criminal Justice Materials Science & Nanotechnology Mathematics Mechanical Engineering Nursing Physics Public Health Transportation

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

Found 1 Documents
Search
Journal : International Journal of Quantitative Research and Modeling

 1 
Implementation of Dynamic Programming Algorithm on The Integer Knapsack Problem (0/1) (Case Study: J&T Cargo Agent Purwokerto) Puspitasari, Leni; Sugandha, Agus; Nurshiami, Siti Rahmah
International Journal of Quantitative Research and Modeling Vol. 6 No. 3 (2025): International Journal of Quantitative Research and Modeling (IJQRM)
Publisher : Research Collaboration Community (RCC)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.46336/ijqrm.v6i3.1077

Abstract

The pu IDR ose of this research is to solve the 0/1 integer knapsack problem, which is a problem of selecting items from a number of available items where each item has different weights and profits. The delivery of items at J&T Cargo Purwokerto is one of many item selection problems. The delivery of items at J&T Cargo Purwokerto is carried out progressively with higher profit values ​​first, due to the delivery capacity being able to accommodate only 700 kg. In order for J&T Cargo Purwokerto to obtain maximum profit, item selection for delivery must be carried out first. The item selection at J&T Cargo Purwokerto can be solved using the 0/1 integer knapsack problem method with a forward recursive dynamic programming algorithm with the help of Matlab R2021A software. The results of the research indicate that on July 1, 2025, a maximum profit of IDR 3,038,850 was achieved with a weight of 700 kg. On 2nd July 2025, a maximum profit of IDR 4,884,985 was achieved with a weight of 700 kg. On 3rd July 2025, a maximum profit of IDR 7,732,155 was achieved with a weight of 699 kg.
Co-Authors Adila, Raisa Naura Agus Sugandha Alfatah Hidayat Amaliyanah, Melly Amariesta, Tiara Ari Fadli Ari Wardayani Ari Wardayani, Ari Dewi, Priska Sari Eko Murdyantoro Fajar Hoeruddin Hidayat, Alfatah Irham Taufiq Irham Taufiq, Irham Jajang Jajang Kana Hasmi Setiani Marulitua Purba, Hotasi Doli Mashuri Mashuri Mashuri Mashuri Melinda, Jessy Muhammad Okky Ibrohim Mutia Nur Estri Mutia Nur Estri Mutia Nur Estri Mutia Nur Estri, Mutia Nur Niken Larasati Noor Rahmah Sofiyati Nunung Nurhayati Nunung Nurhayati Nur Istiqomah, Vina Helmi Nuraliya, Aliffia Yasya Priska Sari Dewi Puspitasari, Leni Rara Wardhani Renny Renny Renny Rina Reorita Setiani, Kana Hasmi Sri Maryani Suroto Suroto Suroto Suroto Taryana, Acep Triyani Triyani Triyani Triyani Triyani Triyani Wardani, Amelia Kusuma Wardhani, Rara