当前位置: X-MOL 学术Transp. Res. Part E Logist. Transp. Rev. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A time-expanded network reduction matheuristic for the logistics service network design problem
Transportation Research Part E: Logistics and Transportation Review ( IF 10.6 ) Pub Date : 2021-01-22 , DOI: 10.1016/j.tre.2020.102203
Simon Belieres , Mike Hewitt , Nicolas Jozefowiez , Frédéric Semet

Planning cost-effective logistics operations involve the integration of multiple decision-making levels. In the domain of supply chain management, the last decades have seen the emergence of 3PL service providers that specialize in integrating warehousing and transportation services. In this paper, we study the operations performed by a 3PL service provider in the supply chain management of a French restaurant chain. The transportation planning process is assisted by solving the Logistics Service Network Design Problem (LSNDP). As realistic instances are too large for on-the-shelf optimization solvers to solve in acceptable run-times, we develop a network reduction heuristic inspired by the recent Dynamic Discretization Discovery algorithm. Through an extensive series of experiments carried out on instances based on the operations of an industrial partner, we demonstrate the efficiency of the proposed approach. We also investigate the impact of the distribution strategy used in practice to determine the transportation plan and how this distribution strategy can be modified to reduce the overall logistics costs.



中文翻译:

时间扩展的网络约简算法用于物流服务网络设计问题

计划具有成本效益的物流业务涉及多个决策层面的整合。在供应链管理领域,近几十年来出现了专门集成仓储和运输服务的3PL服务提供商。在本文中,我们研究了3PL服务提供商在法国餐馆链的供应链管理中执行的操作。解决物流服务网络设计问题(LSNDP)有助于运输规划过程。由于现实的实例对于现成的优化求解器来说太大了,无法在可接受的运行时间内进行求解,因此,我们开发了一种基于最新动态离散化发现算法的网络缩减启发式算法。通过基于工业合作伙伴的操作在实例上进行的一系列广泛实验,我们证明了所提出方法的效率。我们还将调查实际用于确定运输计划的分配策略的影响,以及如何修改此分配策略以降低总体物流成本。

更新日期:2021-01-22
down
wechat
bug