修正Mie Kuliner UKM最小化距离和工作量的默认分配路线

OPSI Pub Date : 2022-12-30 DOI:10.31315/opsi.v15i2.8248
Lisa Amanda Link, Fransiska Hernina Puspitasari, P. Dewa
{"title":"修正Mie Kuliner UKM最小化距离和工作量的默认分配路线","authors":"Lisa Amanda Link, Fransiska Hernina Puspitasari, P. Dewa","doi":"10.31315/opsi.v15i2.8248","DOIUrl":null,"url":null,"abstract":"Delivery activities have a great role for a business actor. However, delivery issues are there all the time. This was experienced by a noodle culinary SME that experienced delays in the delivery of various noodle raw materials and noodle toppings which caused noodle sales activities to be disrupted. In addition, these raw materials have a lifespan (without preservatives) so they must be delivered according to a predetermined schedule and hours. This research will solve this problem by minimizing delays through finding the shortest mileage delivery route. Because each delivery location has its own schedule and time window, the Nearest Neighbor method by paying attention to the time window is used. Based on the calculation results, each distribution route with the shortest distance was obtained, as evidenced by a reduction in the middle route by 0.23 km and the northern route by 5.88 km. In addition, this proposed delivery route was able to save fuel consumption on the middle route by 3% and the northern route by 10%. In terms of the workload aspect, car fleet drivers were also reduced by 31% and motorbike fleet drivers by 47%.","PeriodicalId":34167,"journal":{"name":"OPSI","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Perbaikan Rute Distribusi Bahan Baku untuk Minimasi Jarak Tempuh dan Beban Kerja pada UKM Kuliner Mie\",\"authors\":\"Lisa Amanda Link, Fransiska Hernina Puspitasari, P. Dewa\",\"doi\":\"10.31315/opsi.v15i2.8248\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Delivery activities have a great role for a business actor. However, delivery issues are there all the time. This was experienced by a noodle culinary SME that experienced delays in the delivery of various noodle raw materials and noodle toppings which caused noodle sales activities to be disrupted. In addition, these raw materials have a lifespan (without preservatives) so they must be delivered according to a predetermined schedule and hours. This research will solve this problem by minimizing delays through finding the shortest mileage delivery route. Because each delivery location has its own schedule and time window, the Nearest Neighbor method by paying attention to the time window is used. Based on the calculation results, each distribution route with the shortest distance was obtained, as evidenced by a reduction in the middle route by 0.23 km and the northern route by 5.88 km. In addition, this proposed delivery route was able to save fuel consumption on the middle route by 3% and the northern route by 10%. In terms of the workload aspect, car fleet drivers were also reduced by 31% and motorbike fleet drivers by 47%.\",\"PeriodicalId\":34167,\"journal\":{\"name\":\"OPSI\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"OPSI\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.31315/opsi.v15i2.8248\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"OPSI","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.31315/opsi.v15i2.8248","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

交付活动对商业参与者来说有着重要的作用。然而,交付问题一直存在。一家面条烹饪中小企业经历了这种情况,该企业在交付各种面条原料和面条浇头时出现延误,导致面条销售活动中断。此外,这些原材料有使用寿命(不含防腐剂),因此必须按照预定的时间表和时间交付。这项研究将通过寻找最短里程交付路线来最大限度地减少延误,从而解决这一问题。由于每个交货地点都有自己的时间表和时间窗口,因此使用了关注时间窗口的最近邻方法。根据计算结果,得出了距离最短的每条配送路线,中间路线减少了0.23公里,北方路线减少了5.88公里。此外,该拟议配送路线能够节省3%的中间路线和10%的北方路线的燃料消耗。在工作量方面,车队司机也减少了31%,摩托车车队司机减少了47%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Perbaikan Rute Distribusi Bahan Baku untuk Minimasi Jarak Tempuh dan Beban Kerja pada UKM Kuliner Mie
Delivery activities have a great role for a business actor. However, delivery issues are there all the time. This was experienced by a noodle culinary SME that experienced delays in the delivery of various noodle raw materials and noodle toppings which caused noodle sales activities to be disrupted. In addition, these raw materials have a lifespan (without preservatives) so they must be delivered according to a predetermined schedule and hours. This research will solve this problem by minimizing delays through finding the shortest mileage delivery route. Because each delivery location has its own schedule and time window, the Nearest Neighbor method by paying attention to the time window is used. Based on the calculation results, each distribution route with the shortest distance was obtained, as evidenced by a reduction in the middle route by 0.23 km and the northern route by 5.88 km. In addition, this proposed delivery route was able to save fuel consumption on the middle route by 3% and the northern route by 10%. In terms of the workload aspect, car fleet drivers were also reduced by 31% and motorbike fleet drivers by 47%.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
16
审稿时长
12 weeks
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信