车辆路径:旅行商问题在某乳业中的应用

R. A. Palhares, M.C.B. de Araújo
{"title":"车辆路径:旅行商问题在某乳业中的应用","authors":"R. A. Palhares, M.C.B. de Araújo","doi":"10.1109/IEEM.2018.8607472","DOIUrl":null,"url":null,"abstract":"In the logistics context, the physical distribution is the responsibility of delivery of the correct products, to the exact locations and in the ideal moment, so that the expectation of the level of service is met and the transportation costs are minimized. For this, it is essential that structured routing plans are employed. Thus, this article aims to establish an efficient routing configuration for the delivery of milk and fermented dairy beverages. To create a structured routing plan, it was adopted the Traveling Salesman Problem. Due to a large number of variables analyzed, the Nearest Neighbor Algorithm was applied. Following, clusters that encompass the points closest to each other were determined and transformed into daily routes. The new plan proposed results in a reduction of approximately 3,316.2 kilometers per month. In this way, the proposed route plan will entail logistics efficiency as well as the reduction of company costs.","PeriodicalId":119238,"journal":{"name":"2018 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","volume":"50 2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Vehicle Routing: Application of Travelling Salesman Problem in a Dairy\",\"authors\":\"R. A. Palhares, M.C.B. de Araújo\",\"doi\":\"10.1109/IEEM.2018.8607472\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the logistics context, the physical distribution is the responsibility of delivery of the correct products, to the exact locations and in the ideal moment, so that the expectation of the level of service is met and the transportation costs are minimized. For this, it is essential that structured routing plans are employed. Thus, this article aims to establish an efficient routing configuration for the delivery of milk and fermented dairy beverages. To create a structured routing plan, it was adopted the Traveling Salesman Problem. Due to a large number of variables analyzed, the Nearest Neighbor Algorithm was applied. Following, clusters that encompass the points closest to each other were determined and transformed into daily routes. The new plan proposed results in a reduction of approximately 3,316.2 kilometers per month. In this way, the proposed route plan will entail logistics efficiency as well as the reduction of company costs.\",\"PeriodicalId\":119238,\"journal\":{\"name\":\"2018 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)\",\"volume\":\"50 2\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IEEM.2018.8607472\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IEEM.2018.8607472","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

在物流方面,物流配送的责任是将正确的产品交付到准确的地点和理想的时间,从而达到预期的服务水平,并将运输成本降至最低。为此,必须采用结构化路由计划。因此,本文旨在为牛奶和发酵乳制品饮料的输送建立一个有效的路由配置。为了创建一个结构化的路由计划,采用了旅行商问题。由于分析的变量较多,采用了最近邻算法。接下来,确定了包含彼此最接近的点的集群,并将其转换为日常路线。拟议的新计划每月减少约3 316.2公里。这样,拟议的路线计划将提高物流效率,并降低公司成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Vehicle Routing: Application of Travelling Salesman Problem in a Dairy
In the logistics context, the physical distribution is the responsibility of delivery of the correct products, to the exact locations and in the ideal moment, so that the expectation of the level of service is met and the transportation costs are minimized. For this, it is essential that structured routing plans are employed. Thus, this article aims to establish an efficient routing configuration for the delivery of milk and fermented dairy beverages. To create a structured routing plan, it was adopted the Traveling Salesman Problem. Due to a large number of variables analyzed, the Nearest Neighbor Algorithm was applied. Following, clusters that encompass the points closest to each other were determined and transformed into daily routes. The new plan proposed results in a reduction of approximately 3,316.2 kilometers per month. In this way, the proposed route plan will entail logistics efficiency as well as the reduction of company costs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信