A Branch and Cut Algorithm for Two-Echelon Inventory Routing Problem with End-of-Tour Replenishment Policy  

作　　者：Bi Kouaï Bertin Kayé Doffou Jerome Diako Zacrada Françoise Odile Trey Bi Kouaï Bertin Kayé;Doffou Jerome Diako;Zacrada Françoise Odile Trey(UFR Mathmatiques et Informatique, Universit Flix Houphout-Boigny (UFHB), Abidjan, Cte dIvoire;Laboratoire de Mcanique et Informatique (LAMI), Abidjan, Cte dIvoire;Ecole Suprieure des Technologies de lInformation et de la Communication (ESATIC), Abidjan, Cte dIvoire;Laboratoire des Sciences et Technologies de lInformation et de la Communication (LASTIC), Abidjan, Cte dIvoire)

机构地区：[1]UFR Mathmatiques et Informatique, Universit Flix Houphout-Boigny (UFHB), Abidjan, Cte dIvoire [2]Laboratoire de Mcanique et Informatique (LAMI), Abidjan, Cte dIvoire [3]Ecole Suprieure des Technologies de lInformation et de la Communication (ESATIC), Abidjan, Cte dIvoire [4]Laboratoire des Sciences et Technologies de lInformation et de la Communication (LASTIC), Abidjan, Cte dIvoire

出　　处：《Open Journal of Applied Sciences》2024年第11期3100-3126,共27页应用科学（英文）

摘　　要：This study presents a two-echelon inventory routing problem (2E-IRP) with an end-of-tour replenishment (ETR) policy whose distribution network consists of a supplier, several distribution centers (DCs) and several retailers on a multi-period planning horizon. A formulation of the problem based on vehicle indices is proposed in the form of a mixed integer linear program (MILP). The mathematical model of the problem is solved using a branch and cut (B&C) algorithm. The results of the tests are compared to the results of a branch and price (B&P) algorithm from the literature on 2E-IRP with a classical distribution policy. The results of the tests show that the B&C algorithm solves 197 out of 200 instances (98.5%). The comparison of the B&C and B&P results shows that 185 best solutions are obtained with the B&C algorithm on 197 instances (93.9%). Overall, the B&C algorithm achieves cost reductions ranging from 0.26% to 41.44% compared to the classic 2E-IRP results solved with the B&P algorithm, with an overall average reduction of 18.08%.This study presents a two-echelon inventory routing problem (2E-IRP) with an end-of-tour replenishment (ETR) policy whose distribution network consists of a supplier, several distribution centers (DCs) and several retailers on a multi-period planning horizon. A formulation of the problem based on vehicle indices is proposed in the form of a mixed integer linear program (MILP). The mathematical model of the problem is solved using a branch and cut (B&C) algorithm. The results of the tests are compared to the results of a branch and price (B&P) algorithm from the literature on 2E-IRP with a classical distribution policy. The results of the tests show that the B&C algorithm solves 197 out of 200 instances (98.5%). The comparison of the B&C and B&P results shows that 185 best solutions are obtained with the B&C algorithm on 197 instances (93.9%). Overall, the B&C algorithm achieves cost reductions ranging from 0.26% to 41.44% compared to the classic 2E-IRP results solved with the B&P algorithm, with an overall average reduction of 18.08%.

关 键 词：Multi-Depots 2E-IRP Branch and Cut Algorithm End-of-Tour Replenishment Policy Vendor Managed Inventory 

分 类 号：TN9[电子电信—信息与通信工程]