Article Per Year (5 Year)
p-Index From 2020 - 2025
0.778
P-Index
This Author published in this journals
All Journal JURNAL MATEMATIKA STATISTIKA DAN KOMPUTASI Jurnal Multidisiplin Madani (MUDIMA) Jurnal Riset Rumpun Matematika dan Ilmu Pengetahuan Alam (JURRIMIPA)
Faridawaty Marpaung
Unknown Affiliation
Civil Engineering, Building, Construction & Architecture Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Industrial & Manufacturing Engineering Mathematics Social Sciences

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

Found 3 Documents
Search

 1 
Metode Pengembangan Pendekatan Rata-rata Sampel untuk Menyelesaikan Masalah Program Stokastik Cacah Campuran Faridawaty Marpaung
Jurnal Matematika, Statistika dan Komputasi Vol. 10 No. 2: January 2014
Publisher : Department of Mathematics, Hasanuddin University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (561.954 KB) | DOI: 10.20956/jmsk.v10i2.3414

Abstract

Penelitian ini mengemukakan atau menjelaskan suatu strategi penyelesaian untuk menyelesaikan masalah program integer stokastik dua tahap. Metodologi ini menggunakan rata–rata program stokastik melalui sampel, dan pemecahan rata–rata masalah melalui sebuah algoritma optimal. Tujuan dari skema ini akan menghasilkan sebuah penyelesaian optimal untuk masalah yang sebenarnya dengan pendekatan sebuah eksponensial yang cepat sebagai ukuran sampel yang fix, dijelaskan teknik statistik dan deterministik bounding untuk validasi kualitas dari sebuah calon penyelesaian optimal.
Perbandingan Algoritma Cheapest Insertion Heuristic Dan Nearest Neighbor Dalam Menyelesaikan Traveling Salesman Problem Rizki Putra Sinaga; Faridawaty Marpaung
JURNAL RISET RUMPUN MATEMATIKA DAN ILMU PENGETAHUAN ALAM Vol. 2 No. 2 (2023): Oktober : Jurnal Riset Rumpun Matematika dan Ilmu Pengetahuan Alam
Publisher : Pusat riset dan Inovasi Nasional

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.55606/jurrimipa.v2i2.1614

Abstract

The main problem of the Traveling Salesman Problem is that a salesman travels to several places to go with a known distance and then returns to his original place by using the shortest route from his journey, and all the places the salesman goes to are only allowed once. This research focuses on the problem of distributing goods at PT. The Medan Nugraha Ekakurir (JNE) route with the destination delivery address in the Medan area. The Cheapest Insertion Heuristic Algorithm is an algorithm used to form tours (travels) by gradually building the shortest path route with minimal weight, by adding new points one at a time. One. The Nearest Neighbor Algorithm is a simple and fast algorithm to build a feasible initial tour length from TSP where the technique takes the shortest distance from the initial position regardless of other distances. This study resulted in the conclusion that the application of the cheapest insertion heuristic and nearest neighbor algorithms in terms of finding the distance to the problem of shipping goods at PT. The Medan Nugraha Ekakurir (JNE) route starts with finding the distance between addresses with the help of google maps, then continues with the help of the WinQSB software. Based on the research results obtained using the cheapest insertion heuristic and nearest neighbor algorithms, it is obtained that the search for the shortest route distance for shipping goods at PT. The smaller Medan Nugraha Ekakurir (JNE) route is generated by the nearest neighbor algorithm. This shows that the nearest neighbor algorithm is more effective in terms of finding the traveling distance on the Traveling Salesman Problem problem of shipping goods at PT. Medan's Nugraha Ekakurir (JNE) Line.
Floyd-Warshall Algorithm for Web-Based Route Optimization for a Road Network Study in Medan City Faridawaty Marpaung; Arnita; Tommy; Putri Harliana
Jurnal Multidisiplin Madani Vol. 3 No. 11 (2023): November, 2023
Publisher : PT FORMOSA CENDEKIA GLOBAL

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.55927/mudima.v3i11.6674

Abstract

The socio-demographic conditions of the region have an influence on the transportation performance in the region. This study aims to determine the shortest path between two specified points, namely the starting and the end point of several sub-districts in Medan city, especially the sub-district of Medan Amplas. To get the output, several steps are needed, namely collecting the coordinates of street names and road lengths, which is obtained from Google maps. Graphs are used to present the data. Data analysis is used by Floyd–Warshall Algorithm with HTML Web Application supported by PHP programming language, JavaScript and MySQL database. The test results using the Black Box method show that the system functionality is 100% running well. For testing, the results of the final W_ij and Z^* final matrix calculations generated by the system is same with the manual calculations. Finally, to test the reliability of the system made, the results of the reliability test show the truth of working well and it can be accepted. There are no path deviations, so that the results are as expected
Co-Authors Arnita Lesman Hendry Manullang Rizki Putra Sinaga Tommy