Determination of Distribution Route using Linear Programming Model (Case Study at Washing Jeans Company)

R. Heryanto, Yenny Steephani, Santoso
{"title":"Determination of Distribution Route using Linear Programming Model (Case Study at Washing Jeans Company)","authors":"R. Heryanto, Yenny Steephani, Santoso","doi":"10.2991/icoemis-19.2019.35","DOIUrl":null,"url":null,"abstract":". Distribution activity is important factor to determine service performance from producer to customer. One of distribution problems is about route determination. Some researches explain about Vehicle Routing Problem (VRP). VRP is a development of Traveling Salesman Problem (TSP) with various modifications such as capacity and time constraints. This research try to use linear programming model to solve the problem of Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) based on Dell’Amico, et al (2007) model with some adjustments such as the index period and some functions in cost. Branch and bound method will be used to solve linear programming model and will give the best route with minimum total distribution cost. Case study at washing jeans company which is used for numerical example aim to determine distribution route which could give minimum total distribution cost and time to company. Distribution costs consist of travel cost and overtime cost. Based on calculation process, washing jeans company will get total distribution cost about IDR 160927 per week and actual route which give cost about IDR 181525 per week. The total saving cost about 20598 IDR per week or 11.35% per week.","PeriodicalId":156644,"journal":{"name":"Proceedings of the 2019 1st International Conference on Engineering and Management in Industrial System (ICOEMIS 2019)","volume":"218219 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2019 1st International Conference on Engineering and Management in Industrial System (ICOEMIS 2019)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2991/icoemis-19.2019.35","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

. Distribution activity is important factor to determine service performance from producer to customer. One of distribution problems is about route determination. Some researches explain about Vehicle Routing Problem (VRP). VRP is a development of Traveling Salesman Problem (TSP) with various modifications such as capacity and time constraints. This research try to use linear programming model to solve the problem of Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) based on Dell’Amico, et al (2007) model with some adjustments such as the index period and some functions in cost. Branch and bound method will be used to solve linear programming model and will give the best route with minimum total distribution cost. Case study at washing jeans company which is used for numerical example aim to determine distribution route which could give minimum total distribution cost and time to company. Distribution costs consist of travel cost and overtime cost. Based on calculation process, washing jeans company will get total distribution cost about IDR 160927 per week and actual route which give cost about IDR 181525 per week. The total saving cost about 20598 IDR per week or 11.35% per week.
基于线性规划模型的配送路线确定(以水洗牛仔裤公司为例)
. 分销活动是决定从生产者到消费者的服务绩效的重要因素。其中一个分布问题是关于路线确定。一些研究对车辆路由问题(VRP)进行了解释。VRP是旅行商问题(Traveling Salesman Problem, TSP)的一种发展形式,具有容量约束和时间约束等多种修改形式。本研究尝试在Dell’amico等(2007)模型的基础上,通过调整指标周期和成本函数,采用线性规划模型求解带时间窗的有能力车辆路径问题(CVRPTW)。分支定界法将用于求解线性规划模型,并给出总分配成本最小的最佳路径。以洗涤牛仔裤公司为例进行了数值分析,旨在确定配送路线,使公司的总配送成本和时间最小。配送成本包括差旅费和加班费。根据计算过程,洗涤牛仔裤公司得到的总配送成本约为每周160927印尼币,实际路线的成本约为每周181525印尼币。每周节省的总费用约为20598印尼盾或11.35%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信