Transport Task Models with Variable Supplier Availabilities

IF 3.6 Q2 MANAGEMENT
J. Vasilev, R. Nikolaev, Tanka Milkova
{"title":"Transport Task Models with Variable Supplier Availabilities","authors":"J. Vasilev, R. Nikolaev, Tanka Milkova","doi":"10.3390/logistics7030045","DOIUrl":null,"url":null,"abstract":"Background: With regard to the definition of an optimal transport plan for some material flow in the logistics system in literature and practice, the classical transport task model is developed. The minimization of total transport costs is usually considered for optimality. Some modifications to the classical transport task have also been developed. Methods: The article uses the methods of linear optimization. Based on these methods, two modified transport task models have been constructed, which consider the possibility of planning in advance the quantities available from the suppliers of the transported cargo. These models are applicable in SCM for pharmaceuticals with a national logistics hub. Furthermore, a solver in MS Excel is used to determine the optimal solution of optimization models. Results: Two new (modified, extended) models of the transport task have been constructed, in which a preliminary planning of the available quantities of the transported cargo at the suppliers is made. These quantities shall be planned in such a way as to ensure a minimum total transport cost. Conclusions: By applying the proposed new transport task models, lower total transport costs for carrying out imported pharmaceuticals can be ensured compared to an application of the classical transport task model.","PeriodicalId":56264,"journal":{"name":"Logistics-Basel","volume":null,"pages":null},"PeriodicalIF":3.6000,"publicationDate":"2023-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Logistics-Basel","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3390/logistics7030045","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MANAGEMENT","Score":null,"Total":0}
引用次数: 0

Abstract

Background: With regard to the definition of an optimal transport plan for some material flow in the logistics system in literature and practice, the classical transport task model is developed. The minimization of total transport costs is usually considered for optimality. Some modifications to the classical transport task have also been developed. Methods: The article uses the methods of linear optimization. Based on these methods, two modified transport task models have been constructed, which consider the possibility of planning in advance the quantities available from the suppliers of the transported cargo. These models are applicable in SCM for pharmaceuticals with a national logistics hub. Furthermore, a solver in MS Excel is used to determine the optimal solution of optimization models. Results: Two new (modified, extended) models of the transport task have been constructed, in which a preliminary planning of the available quantities of the transported cargo at the suppliers is made. These quantities shall be planned in such a way as to ensure a minimum total transport cost. Conclusions: By applying the proposed new transport task models, lower total transport costs for carrying out imported pharmaceuticals can be ensured compared to an application of the classical transport task model.
具有可变供应商可用性的运输任务模型
背景:针对文献和实践中物流系统中某些物流的最优运输计划的定义,建立了经典的运输任务模型。总运输成本的最小化通常被认为是最优性。对经典运输任务也进行了一些修改。方法:采用线性优化方法。基于这些方法,构建了两个修改后的运输任务模型,考虑了提前规划从运输货物供应商处获得的数量的可能性。这些模型适用于具有国家物流中心的药品供应链管理。此外,使用MS Excel中的求解器来确定优化模型的最优解。结果:构建了两个新的(修改、扩展)运输任务模型,其中对供应商的可用运输货物数量进行了初步规划。这些数量的计划应确保总运输成本最低。结论:通过应用所提出的新运输任务模型,与应用经典运输任务模型相比,可以确保进口药品的总运输成本更低。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Logistics-Basel
Logistics-Basel Multiple-
CiteScore
6.60
自引率
0.00%
发文量
0
审稿时长
11 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学术文献互助群
群 号:481959085
Book学术官方微信