...
首页> 外文期刊>Uludag University Journal of The Faculty of Engineering >KAR?ILANAMAYAN TALEPL? ?OKLU üRüN ENVANTER YERLE??M VE ROTALAMA PROBLEM?
【24h】

KAR?ILANAMAYAN TALEPL? ?OKLU üRüN ENVANTER YERLE??M VE ROTALAMA PROBLEM?

机译:利润?无退款索赔? ?arrow产品库存的地方?m和路由问题?

获取原文
           

摘要

The companies, who wants to adapt to the changedmarket conditions and remain competitive, have to manage their storage anddistribution processes in a cost effective manner as well as their productionprocesses. The logistic costs consume a significant part of the budget of thecompanies and therefore these processes must be managed as efficiently aspossible. The design of such an effective logistic network contains two hardcombinatorial optimization problems, to locate facilities, and to determinevehicle routes supplying demand points from these locations. Within the contextof this study, we deal with the Location Inventory Routing Problem (LIRP),which is an enriched Location Routing Problem (LRP) with the inventory relatedissues and determines inventory, location and transportation related decisionsat the strategic, tactical and operational levels. A mathematical model, acombination of a location-routing problem and a joint replenishment economicorder quantity (EOQ) model with backorders, is developed to formally describethe problem. Large neighborhood search algorithm is developed to solve theproblem. Comparative results with the location-routing problem data sets from theliterature is used in order to evaluate solution method. The best known resultsin the literature have been found or the best results have been approached forboth problem dataset.
机译:该公司希望适应换乘条件并保持竞争力,必须以成本效益的方式和生产过程管理其存储和分布过程。物流成本消耗了一部分基础预算的重要组成部分,因此必须以有效的动力管理这些流程。这种有效物流网络的设计包含了两个硬组播优化问题,以定位设施,并确定从这些位置提供需求点的路线。在本研究的范围内,我们处理Lique Inventory Routing问题(LIRP),它是一个丰富的位置路由问题(LRP),并与库存相关,并确定库存,地点和运输相关的决定战略,战术和业务层面。建立了一个数学模型,位置路由问题的丙合突和带回律的联合补充经济乐标量(EOQ)模型,以正式描述了问题。大型邻域搜索算法是开发出解决问题的。使用来自theliterature的位置路由问题数据集的比较结果用于评估解决方案方法。已找到最佳已知的结果函数,或者已接近出丢弃问题数据集的最佳结果。

著录项

相似文献

  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号