MINIMASI BIAYA DISTRIBUSI MENGGUNAKAN ALGORITMA NEAREST NEIGHBOUR (STUDI KASUS STOCKIST PT. XYZ)
DOI:
https://doi.org/10.21111/atj.v3i1.3792Keywords:
Distribution, Nearest Neighbors, VRPAbstract
Distribution is a process of delivering products from producers to consumers. The distribution process determines the selling price and improves the product, therefore determining the distribution route becomes important. at this time Stockist PT. XYZ determine the distribution route in the order of ordering from the store. The purpose of this study is to minimize distribution costs so as to increase profits. The nearest neighbor algorithm is one of the algorithms in Vehicle Routing Problem (VRP) that is used to determine the route in the distribution process based on proximity. The results of this study, the nearest neighbor algorithm can help the cost of PT. XYZ was 39.18% on March 5, 2019 and 0.82% on March 6, 2019.Downloads
Submitted
Published
How to Cite
Issue
Section
License
The author whose published manuscript approved the following provisions:
1. The right of publication of all material published in the journal / published in the Agroindustrial Technology Journal is held by the editorial board with the knowledge of the author (moral rights remain the author of the script).
2. The formal legal provisions for access to digital articles of this electronic journal are subject to the terms of the Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License (CC BY-NC-SA 4.0), which means that Agroindustrial Technology Journal reserves the right to save, transmit media or format, Database), maintain, and publish articles without requesting permission from the Author as long as it keeps the Author's name as the owner of Copyright.
3. Printed and electronically published manuscripts are open access for educational, research and library purposes. In addition to these objectives, the editorial board shall not be liable for violations of copyright law.