期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 288, 期 2, 页码 436-449出版社
ELSEVIER
DOI: 10.1016/j.ejor.2020.05.054
关键词
Logistics; Two-echelon production-routing; Local search; Branch-and-cut; Parallel computing
资金
- Coordenacao de Aperfeicoamento de Pessoal de Nivel Superior - Brasil (CAPES) [1554767]
- Canadian Natural Sciences and Engineering Research Council (NSERC) [2019-00094]
This paper introduces the Two-Echelon Production-Routing Problem and presents methods and experimental results for solving the problem. By evaluating the effectiveness of different inventory policies and their impact on costs, a novel solution is proposed and demonstrated to be competitive through computational experiments.
This paper introduces the Two-Echelon Production-Routing Problem. This problem is motivated from the petrochemical industry, enlarging the supply chain integration by taking into account production, inventory, and routing decisions in a two-echelon vendor-managed inventory system. We describe, model, and design a branch-and-cut (B&C) to solve the problem under different inventory policies. We also propose a novel exact algorithm, by employing parallel computing techniques, in order to combine local search procedures within a traditional B&C scheme. We evaluate the performance of our methods through extensive computational experiments, both by comparing the algorithms, the effectiveness of the different inventory policies, and the impact of these policies on the partial costs. We derive many managerial insights based on the results. We also validate our new exact algorithm by solving similar problems from the literature, such as the two-echelon multi-depot inventory-routing (2E-MDIRP) and the classical multi vehicle production-routing problem (MV-PRP). Computational experiments show that our method is very competitive. Based on 512 experiments for the 2E-MDIRP, our algorithm was able to find 111 new best known solutions (BKS), besides proving 412 optimal solutions, against 298 from the literature. For 336 experiments over small and medium size MV-PRP instances, we proved 242 optimal solutions, 11 more than the exact methods from the literature, besides providing 95 new BKS. Moreover, we were the first to tackle large MV-PRP instances exactly, and in this case, our algorithm provides all BKS for instances up to 50 customers, 20 periods and 5 vehicles, outperforming all meta/matheuristics procedures from the literature. (C) 2020 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据