利用k近邻算法和节省矩阵法确定货物的交付,以获得最优路线并节省成本

Lidiawati, H. Setiawan, Adhitya Ilham Ramdhani, Satria, Sulistyowati, K. Mukiman
{"title":"利用k近邻算法和节省矩阵法确定货物的交付,以获得最优路线并节省成本","authors":"Lidiawati, H. Setiawan, Adhitya Ilham Ramdhani, Satria, Sulistyowati, K. Mukiman","doi":"10.1109/ICCoSITE57641.2023.10127714","DOIUrl":null,"url":null,"abstract":"Delivery of goods is a transaction or agreement between the seller and the buyer that produces an item to be transported and sent to the buyer. This study found problems with the late delivery of goods, namely limited vehicle capacity which resulted in delays in delivery of goods by sellers, delays in receiving goods by customers, and expensive transportation costs as a result where customers became dissatisfied with delivery services, decreased number of purchases, decreased delivery of goods and losses incurred suffered by the company or the seller in terms of costs or profits. The k-nearest neighbor algorithm is a classification technique by choosing a distance based on the size of the shortest distance and a saving matrix method that will form a delivery route taking into account vehicle capacity and saving on transportation costs. And later it will be formed into several new routes that aim to facilitate the delivery of goods with the advantage of providing satisfaction to customers and being able to save on transportation costs. So this research was developed for the route of delivery of goods by taking into account the capacity and number of vehicles which in previous studies regarding delivery routes. The results of this study solve the problem quite optimally at 12.67% or Rp. 757,356 cost savings while the delivery of goods resulted in 6 shipping lines instead of 11 shipping lines which cut 5 shipping lines or 11.11% for a total of 1532.15 Km.","PeriodicalId":256184,"journal":{"name":"2023 International Conference on Computer Science, Information Technology and Engineering (ICCoSITE)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Determining The Delivery Of Goods Using The K-Nearest Neighbor Algorithm And The Saving Matrix Method To Obtain The Optimal Route And Save Costs\",\"authors\":\"Lidiawati, H. Setiawan, Adhitya Ilham Ramdhani, Satria, Sulistyowati, K. Mukiman\",\"doi\":\"10.1109/ICCoSITE57641.2023.10127714\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Delivery of goods is a transaction or agreement between the seller and the buyer that produces an item to be transported and sent to the buyer. This study found problems with the late delivery of goods, namely limited vehicle capacity which resulted in delays in delivery of goods by sellers, delays in receiving goods by customers, and expensive transportation costs as a result where customers became dissatisfied with delivery services, decreased number of purchases, decreased delivery of goods and losses incurred suffered by the company or the seller in terms of costs or profits. The k-nearest neighbor algorithm is a classification technique by choosing a distance based on the size of the shortest distance and a saving matrix method that will form a delivery route taking into account vehicle capacity and saving on transportation costs. And later it will be formed into several new routes that aim to facilitate the delivery of goods with the advantage of providing satisfaction to customers and being able to save on transportation costs. So this research was developed for the route of delivery of goods by taking into account the capacity and number of vehicles which in previous studies regarding delivery routes. The results of this study solve the problem quite optimally at 12.67% or Rp. 757,356 cost savings while the delivery of goods resulted in 6 shipping lines instead of 11 shipping lines which cut 5 shipping lines or 11.11% for a total of 1532.15 Km.\",\"PeriodicalId\":256184,\"journal\":{\"name\":\"2023 International Conference on Computer Science, Information Technology and Engineering (ICCoSITE)\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-02-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 International Conference on Computer Science, Information Technology and Engineering (ICCoSITE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCoSITE57641.2023.10127714\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 International Conference on Computer Science, Information Technology and Engineering (ICCoSITE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCoSITE57641.2023.10127714","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

货物交付是卖方和买方之间的交易或协议,即生产要运输并发送给买方的物品。本研究发现了货物延迟交付的问题,即车辆容量有限,导致卖方交货延迟,客户接收货物延迟,以及昂贵的运输成本,导致客户对交付服务不满意,购买次数减少,货物交付减少,公司或卖方在成本或利润方面遭受损失。k近邻算法是一种根据最短距离的大小选择距离的分类技术,是一种考虑车辆容量和节省运输成本形成配送路线的节省矩阵法。之后将形成几条新的路线,旨在方便货物的交付,使客户满意,并能够节省运输成本。因此,本研究是针对货物的交付路线,考虑到能力和车辆的数量,在以往的研究中,关于交付路线开发的。这项研究的结果以12.67%或757,356卢比的成本节约非常理想地解决了这个问题,而货物的交付导致6条航运线而不是11条航运线,这减少了5条航运线或11.11%,共计1532.15公里。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Determining The Delivery Of Goods Using The K-Nearest Neighbor Algorithm And The Saving Matrix Method To Obtain The Optimal Route And Save Costs
Delivery of goods is a transaction or agreement between the seller and the buyer that produces an item to be transported and sent to the buyer. This study found problems with the late delivery of goods, namely limited vehicle capacity which resulted in delays in delivery of goods by sellers, delays in receiving goods by customers, and expensive transportation costs as a result where customers became dissatisfied with delivery services, decreased number of purchases, decreased delivery of goods and losses incurred suffered by the company or the seller in terms of costs or profits. The k-nearest neighbor algorithm is a classification technique by choosing a distance based on the size of the shortest distance and a saving matrix method that will form a delivery route taking into account vehicle capacity and saving on transportation costs. And later it will be formed into several new routes that aim to facilitate the delivery of goods with the advantage of providing satisfaction to customers and being able to save on transportation costs. So this research was developed for the route of delivery of goods by taking into account the capacity and number of vehicles which in previous studies regarding delivery routes. The results of this study solve the problem quite optimally at 12.67% or Rp. 757,356 cost savings while the delivery of goods resulted in 6 shipping lines instead of 11 shipping lines which cut 5 shipping lines or 11.11% for a total of 1532.15 Km.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信