Article Per Year (5 Year)
p-Index From 2020 - 2025
0.61
P-Index
This Author published in this journals
All Journal Jurnal Ilmiah Matematika dan Pendidikan Matematika (JMP) Asimetris: Pendidikan Matematika dan Sains Hipotenusa: Journal of Mathematical Society
Sumarsa, Amar
Unknown Affiliation
Chemistry Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Mathematics Physics

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

Found 3 Documents
Search

 1 
PENERAPAN MULTIPLE TRAVELING SALESMAN PROBLEM PADA OPTIMASI PENDISTRIBUSIAN Widyastiti, Maya; Sumarsa, Amar; Permana, Alfina Yulia
Jurnal Ilmiah Matematika dan Pendidikan Matematika Vol 16 No 1 (2024): Jurnal Ilmiah Matematika dan Pendidikan Matematika (JMP)
Publisher : Universitas Jenderal Soedirman

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20884/1.jmp.2024.16.1.10860

Abstract

ABSTRACT. Distribution is one of the important activities in sending goods from producers to consumers. This research was applied to PT. Kobe Boga Utama, Depok Branch. This company distributed products to 333 outlets in 2 weeks from Monday to Saturday. On certain days, the company visited more than one trip, requiring several salesmen. The distribution problem can be formed as a Multiple Traveling Salesman Problem and modeled as an Integer Linear Programming problem. This research aims to determine the optimal route with the shortest distance using the Branch and Bound method. The research results show that the salesman has to cover a minimum distance is 732.83 km in odd weeks with 149 outlets to visit. The number of trips taken is 7 trips, consisting of 1 trip on Monday, Thursday, and Friday, and 2 trips on Wednesday and Thursday. On even weeks, a salesman must visit 184 outlets with a minimum distance is 1292.3 km, consisting of 1 trip on Tuesday, Thursday, Friday, and Saturday, 2 trips on Wednesday, and 3 trips on Monday. The total minimum distance is 2025.09 km. The optimization result is about 359.97 km (49.12%) for odd weeks and 506.61 km (39.2%) for even weeks.Keywords:: Distribution, Muliple Traveling Salesman Problem, Branch and Bound Method ABSTRAK. Pendistribusian merupakan salah satu kegiatan penting dalam mengirimkan barang dari produsen ke konsumen. Penelitian ini diterapkan pada PT. Kobe Boga Utama Cabang Depok. Perusahaan ini mendistribusikan produk ke 333 outlet dalam 2 pekan dari hari Senin hingga Sabtu. Pada hari tertentu, perusahaan mengunjungi lebih dari satu trip sehingga membutuhkan beberapa salesman. Masalah pendistribusian dapat dibentuk sebagai Multiple Traveling Salesman Problem dan dimodelkan sebagai masalah Integer Linear Programming. Penelitian ini bertujuan untuk menentukan rute optimal dengan jarak tempuh terpendek menggunakan metode Branch and Bound. Hasil penelitian menunjukkan bahwa pada pekan ganjil, salesman harus menempuh jarak minimal sebesar 732.83 km dengan outlet yang harus dikunjungi sebanyak 149. Banyaknya trip yang dilalui sebanyak 7 trip, yang terdiri dari 1 trip pada hari Senin, Kamis, dan Jumat, serta 2 trip untuk hari Rabu dan Kamis. Pada pekan genap, salesman harus mengunjungi 184 outlet dengan total jarak minimum sebesar 1292.3 km, yang terdiri dari 1 trip pada hari Selasa, Kamis, Jumat, dan Sabtu, 2 trip untuk hari Rabu, dan 3 trip untuk hari Senin. Total jarak tempuh minimum sebesar 2025.09 km. Hasil optimal dari pekan ganjil sebesar 359.97 km (49.12%) dan untuk pekan genap sebesar 506.61 km (39.2%).Kata Kunci:: Distribusi, Integer Linear Programming, Metode Branch and Bound, Multiple Traveling Salesman Problem
Utilization of Geogebra Application as Learning Media in Learning The Three-Dimensional to Increase Students' Interest in Learning Widyastiti, Maya; Yanti, Yusma; Sumarsa, Amar; Durrotul Faizah, Layla
Hipotenusa: Journal of Mathematical Society Vol. 6 No. 1 (2024): Hipotenusa: Journal of Mathematical Society
Publisher : Program Studi Tadris Matematika Universitas Islam Negeri (UIN) Salatiga

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18326/hipotenusa.v6i1.815

Abstract

This activity aims to describe students' interest in learning, learning outcomes, and the benefits of using GeoGebra in learning the three-dimensional. The data collected were analyzed using descriptive analysis. The research subjects were 59 students of SMA Negeri 1 Megamendung. Data collection techniques used tests and questionnaires. This research consists of 2 cycles. In cycle 1, the results obtained based on students' interest in learning showed that on average students strongly agreed 18.6%, agreed 31.1%, moderately 44.3%, and disagreed 5.9%. In cycle 2 after using the GeoGebra application, student interest increased to strongly agree 30.9%, agree 48.7%, moderately 18.6% and disagree 1.7%. Based on the learning outcomes in cycle 1, it shows 42.37% of students can solve problems well, while in cycle 2 there is an increase in the percentage of learning outcomes to 56.59%. Based on the results of the above analysis, it can be concluded that GeoGebra is very useful as a learning media and there is an increase in student interest and learning outcomes in learning the three-dimensional using GeoGebra.
Implementasi Simultaneous Pick Up and Delivery Vehicle Routing Problem with Time Windows Menggunakan Integer Non-Linier Programming Widyastiti, Maya Widyastiti; Sumarsa, Amar
Asimetris: Jurnal Pendidikan Matematika dan Sains Vol. 4 No. 2 (2023): Asimetris: Jurnal Pendidikan Matematika dan Sains
Publisher : Pendidikan Matematika Universitas Almuslim

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.51179/asimetris.v4i2.2257

Abstract

Penelitian ini bertujuan untuk mengimplementasikan variasi dari model Vehicle Routing Problem (VRP) untuk melakukan pendistribusian suatu barang, Rute yang dirancang untuk menentukan banyaknya kendaraan yang digunakan dan rute terpendek pendistribusian. Model Pickup and Delivery Vehicle Routing Problem with Time Windows (PDVRPTW) dimodelkan dalam bentuk Integer Non-Linear Programming, dan diselesaikan menggunakan metode Branch and Bound. Model ini digunakan karena dapat menghasilkan solusi dalam menyelesaikan masalah optimisasi rute dengan batasan tertentu. PDVRPTW merupakan permasalahan rute kendaraan dimana setiap konsumen terjadi pengiriman dan pengambilan barang sekaligus dan terdapat batasan waktu. Hasil yang diperoleh sebanyak 4 kendaraan yang digunakan. Jarak tempuh terpendek sebesar 26816 meter. Jarak tempuh kendaraan 1 sebesar 5299 meter, kendaraan 2 sebesar 6546 meter, kendaraan 3 sebesar 6684 meter dan kendaraan 4 sebesar 8287 meter. Hasil penentuan rute menggunakan metode Branch and Bound memberikan rute yang lebih baik, dimana jarak pengiriman dapat dihemat sebesar 2575 meter atau 9,6%.
Co-Authors Durrotul Faizah, Layla Maya Widyastiti, Maya Permana, Alfina Yulia Widyastiti, Maya Widyastiti Yanti, Yusma