Claim Missing Document
Check
Articles

Found 3 Documents
Search

Baby Diaper Recommendation Decision Support System Using SAW Method Aprilia, Rima; Irawan, Muhammad Dedi; Irawati, Novica; Hasibuan, Aidillia Adha; Nuha, Salsabila Isnain
International Conference on Sciences Development and Technology The 1st ICoSDTech 2021
Publisher : International Conference on Sciences Development and Technology

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (333.765 KB)

Abstract

The selection of baby diapers is very important for housewives which aims to avoid things that are not desirable, in the process of this decision support system there are several comparison criteria that will be a reference in the selection of baby diapers. In the process of the decision support system for choosing baby diapers using the SAW method, it aims to provide recommendations in giving baby diapers. This baby diaper decision support system is designed using a MySQL database system to test and find out the ranking of several available alternatives. The decision support system produced in this study can display the ranking of the results of SAW calculations to make housewives' considerations in choosing baby diapers
Optimization Of Bread Distribution Transportation Costs At Ud Bakery Garden Using The MDMA Method (Maximum Divide Minimum Alloment) Febrianti, Putri Rizky; Dur, Sajaratud; Aprilia, Rima
International Conference on Sciences Development and Technology The 2nd ICoSDTech 2022
Publisher : International Conference on Sciences Development and Technology

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (364.97 KB)

Abstract

This study aims to optimize distribution transportation costs using a transportation model. The transportation model is a model that aims to determine the number of goods that must be sent from source to destination so that total transportation costs can be optimized. The transportation model used in this study is the Maximum Divide Minimum Aloment (MDMA) method. Data collection is in progress using Maximum Divide Minimum Aloment (MDMA), namely data on fixed costs, variable costs, demand and capacity of goods. The results of optimization research using the Maximum Divide Minimum Aloment (MDMA) method were obtained at Rp. 24,541,890 and has a difference with the costs incurred by the company of Rp. 3,449,660. Therefore, the MDMA (Maximum Divide Minimum Aloment) method can solve problems or can be used to minimize transportation costs.
The comparison between the nearest neighbor algorithm and the a-star algorithm to determine the optimal route for distributing napkin tissue Lubis, Riri Syafitri; Aprilia, Rima; Ropiqoh, Ropiqoh; Harleni, Silvia
AXIOM : Jurnal Pendidikan dan Matematika Vol 13, No 1 (2024)
Publisher : Universitas Islam Negeri Sumatera Utara Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30821/axiom.v13i1.19977

Abstract

Distribution is a factor that greatly influences the success of a company in selling its products. PT. Medan Jutarasa is a company that operates in the napkin tissue industry and has a Distribution Center (DC) to supply products to distributors. Distribution of products to consumers requires appropriate planning and consideration of which route to use to obtain more time-efficient transportation costs. In the delivery process, the company experienced problems, especially in the distribution route. The Nearest Neighbor algorithm searches for customers to serve based on the shortest distance from the vehicle's last location for further distribution. Meanwhile, the A-Star algorithm finds the shortest path using minimum cost. This research aims to compare the Nearest Neighbor algorithm and the A-Star algorithm to determine the optimal route for distributing tissue napkins by PT. Millionaire Medan. Based on the research results, it was found that the route using the Nearest Neighbor algorithm was more optimal than the A-Star algorithm in the distribution of tissue napkins by PT. Millionaire Medan.