Article Per Year (5 Year)
p-Index From 2019 - 2024
0.562
P-Index
This Author published in this journals
All Journal NUMERICAL (Jurnal Matematika dan Pendidikan Matematika) Jurnal IPTEK Bagi Masyarakat
Zakaria Alfikri Sirait
Universitas Islam Negeri Sumatera Utara
Agriculture, Biological Sciences & Forestry Humanities Computer Science & IT Education Mathematics Mechanical Engineering Physics Public Health Social Sciences

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

Found 3 Documents
Search

 1 
Menentukan Rute Terpendek dari BNNP-SU ke KEJATISU Menggunakan Metode Dynamic Programming Muhammad Ridwan; Roshihan Mawazzi Lubis; Zakaria Alfikri Sirait; Machrani Adi Putri Siregar
Jurnal IPTEK Bagi Masyarakat Vol 2 No 3 (2023): April 2023
Publisher : Ali Institute of Research and Publication

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.55537/jibm.v2i3.540

Abstract

Kerja praktek (KP) merupakan kegiatan akademik yang ditujukan pada cara-cara belajar mahasiswa untuk mengembangkan dan meningkatkan tenaga kerja yang berkualitas. Selama penulis melakukan kerja praktek di Badan Narkotika Nasional Provinsi Sumatera Utara (BNNP SUMUT), untuk mengantarkan surat menyurat ke Pengadilan Tinggi Negara Bagian Sumatera Utara (KEJATISU) mengalami keterlambatan pengiriman. Maka penulis memberikan masukan untuk mencari rute terpendek menggunakan program dinamis. Pemrograman dinamis adalah tugas metode solusi, membagi solusi menjadi satu set (fase). Penelitian diawali dengan menentukan titik-titik yang akan dilalui dan mencari jarak menggunakan peta Google. setelah didapatkan kemudian dicari jalur terpendek dengan metode program dinamis dan jalur terpendek yang didapatkan dengan metode dinamis adalah BNNP - Stadion Teladan - Samsat Medan Selatan - Kejaksaan Tinggi Sumatera Utara. Total nilai 13,6 km.
Completion of CVRP with a Combination of Sweep and Local Search Algorithms (Case Study: PT. AJW) Zakaria Alfikri Sirait; Riri Syafitri Lubis
Numerical: Jurnal Matematika dan Pendidikan Matematika Vol. 7 No. 1 (2023)
Publisher : Institut Agama Islam Ma'arif NU (IAIMNU) Metro Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25217/numerical.v7i1.3446

Abstract

AJW is a consumer goods distribution company for Indofood products and non-Indofood products. PT. AJW moves throughout Karo district. The number of tourist attractions in Karo makes the demand for goods higher such as Pop noodles, Indomie, chitato and others. Thus, having an impact on the distribution of goods Based on the author's observations at PT. AJW Kabanjahe has no standard provisions in determining the route, the delivery of goods is still carried out based on requests from consumers so that it ignores the distance traveled and time. A way that can solve this distribution problem is the Capacitated Vehicle Routing Problem (CVRP). CVRP is a problem in determining the optimal route by looking at the problem that each vehicle has a capacity limit. To solve CVRP problems, a good heuristic algorithm is used is the sweep algorithm and local search route improvement. This study uses the sweep algorithm to solve the CVRP problem, and the routes obtained by the sweep algorithm will be improved with local search. The sweep algorithm is a simple method of calculation, even for calculating large problems. The sweep algorithm will be combined with local search. Local search is an algorithm used to get shorter routes. The combination of the two algorithms is perfect for solving CVRP problems. After research, a distance of 39.96 km was obtained compared to the company's route of 103.5 km. So the percentage of mileage savings is 61.39%. This shows that sweep algorithms can minimize distance while saving company expenses
Completion of CVRP with a Combination of Sweep and Local Search Algorithms (Case Study: PT. AJW) Zakaria Alfikri Sirait; Riri Syafitri Lubis
Numerical: Jurnal Matematika dan Pendidikan Matematika Vol. 7 No. 1 (2023)
Publisher : Institut Agama Islam Ma'arif NU (IAIMNU) Metro Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25217/numerical.v7i1.3446

Abstract

AJW is a consumer goods distribution company for Indofood products and non-Indofood products. PT. AJW moves throughout Karo district. The number of tourist attractions in Karo makes the demand for goods higher such as Pop noodles, Indomie, chitato and others. Thus, having an impact on the distribution of goods Based on the author's observations at PT. AJW Kabanjahe has no standard provisions in determining the route, the delivery of goods is still carried out based on requests from consumers so that it ignores the distance traveled and time. A way that can solve this distribution problem is the Capacitated Vehicle Routing Problem (CVRP). CVRP is a problem in determining the optimal route by looking at the problem that each vehicle has a capacity limit. To solve CVRP problems, a good heuristic algorithm is used is the sweep algorithm and local search route improvement. This study uses the sweep algorithm to solve the CVRP problem, and the routes obtained by the sweep algorithm will be improved with local search. The sweep algorithm is a simple method of calculation, even for calculating large problems. The sweep algorithm will be combined with local search. Local search is an algorithm used to get shorter routes. The combination of the two algorithms is perfect for solving CVRP problems. After research, a distance of 39.96 km was obtained compared to the company's route of 103.5 km. So the percentage of mileage savings is 61.39%. This shows that sweep algorithms can minimize distance while saving company expenses
Co-Authors Lubis, Riri Syafitri Muhammad Ridwan Roshihan Mawazzi Lubis Siregar, Machrani Adi Putri