• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Applied Mathematical Modelling >Decision model for the customer order decoupling point considering order insertion scheduling with capacity and time constraints in logistics service supply chain
【24h】

Decision model for the customer order decoupling point considering order insertion scheduling with capacity and time constraints in logistics service supply chain

机译：考虑容量和时间约束的物流服务供应链中订单插入调度的客户订单解耦点决策模型

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In the context of mass customization logistics service, we explore how a new inserted order affects the logistics service integrator (LSIs) decision regarding the location of the customer order decoupling point (CODP). Considering a two-echelon logistics service supply chain (LSSC), consisting of an LSI and several functional logistics service providers (FLSPs), we establish a CODP decision model based on time scheduling with capacity and time constraints. The optimization objectives of the model include minimizing the average unit operation cost for the LSI and maximizing the average satisfaction of the FLSPs. In order to verify the viability of our model, with specific data derived from the daily scheduling operation records of the Baoyun Logistics Company, we perform a numerical analysis using genetic algorithms based on multiple datasets where a single parameter is changed each time while the other parameters remain unchanged. The results show that the CODP moves earlier with the increase of the volume of new order. Furthermore, as the new order's similarity coefficient increases or the new order's completion time requirement is relaxed, the CODP moves later in the LSSC. With a given similarity coefficient or time patience variance related to the new order, the maximum insertion volume decreases and the CODP moves later in the LSSC.
机译：在大规模定制物流服务的背景下，我们探索新插入的订单如何影响物流服务集成商（LSI）关于客户订单去耦点（CODP）位置的决策。考虑一个由LSI和几个功能性物流服务提供商（FLSP）组成的两级物流服务供应链（LSSC），我们基于具有容量和时间约束的时间调度，建立了CODP决策模型。该模型的优化目标包括：最小化LSI的平均单位运营成本，以及最大化FLSP的平均满意度。为了验证我们模型的可行性，我们使用来自宝运物流公司日常调度运行记录的特定数据，使用遗传算法基于多个数据集进行了数值分析，其中每个参数每次都更改，而其他参数每次更改维持不变。结果表明，随着新订单量的增加，CODP移得更早。此外，随着新订单相似系数的增加或新订单完成时间要求的放宽，CODP随后将在LSSC中移动。在给定的相似系数或与新订单相关的时间耐心方差的情况下，最大插入量会减少，并且CODP稍后会在LSSC中移动。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号