Towards efficient solutions for vehicle routing problems for oxygen supply chains

IF 3.9 2区工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Computers & Chemical Engineering Pub Date : 2024-08-14 DOI:10.1016/j.compchemeng.2024.108827

Yena Lee , Karthik Thyagarajan , Jose M. Pinto , Vassilis M. Charitopoulos , Lazaros G. Papageorgiou

{"title":"Towards efficient solutions for vehicle routing problems for oxygen supply chains","authors":"Yena Lee , Karthik Thyagarajan , Jose M. Pinto , Vassilis M. Charitopoulos , Lazaros G. Papageorgiou","doi":"10.1016/j.compchemeng.2024.108827","DOIUrl":null,"url":null,"abstract":"<div><p>This work investigates the integrated production–inventory-routing problem (PIRP) for liquid oxygen supply chains consisting of multiple plants, customers, and heterogeneous vehicles. Solving such a problem is challenging, especially when dealing with large-scale industrial scales. A two-level procedure is adopted that determines decisions regarding production, inventory, and product allocation by simplifying the routing component in the first level. Then, the routing decisions are considered in the lower level for which 3-index mathematical programming formulations are presented. To address the combinatorial complexity of the lower-level decisions, we propose alternative multi-trip heterogeneous vehicle routing problem (MTHVRP) formulations together with a column generation-based solution strategy. A set of test instances and a real-world case study demonstrate the applicability and performance of the formulations and solution methods.</p></div>","PeriodicalId":286,"journal":{"name":"Computers & Chemical Engineering","volume":"191 ","pages":"Article 108827"},"PeriodicalIF":3.9000,"publicationDate":"2024-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S009813542400245X/pdfft?md5=77fc095dc484c3779e328e63bd8afdf8&pid=1-s2.0-S009813542400245X-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Chemical Engineering","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S009813542400245X","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}

引用次数: 0

Abstract

This work investigates the integrated production–inventory-routing problem (PIRP) for liquid oxygen supply chains consisting of multiple plants, customers, and heterogeneous vehicles. Solving such a problem is challenging, especially when dealing with large-scale industrial scales. A two-level procedure is adopted that determines decisions regarding production, inventory, and product allocation by simplifying the routing component in the first level. Then, the routing decisions are considered in the lower level for which 3-index mathematical programming formulations are presented. To address the combinatorial complexity of the lower-level decisions, we propose alternative multi-trip heterogeneous vehicle routing problem (MTHVRP) formulations together with a column generation-based solution strategy. A set of test instances and a real-world case study demonstrate the applicability and performance of the formulations and solution methods.

查看原文本刊更多论文

为氧气供应链的车辆路线问题提供高效解决方案

这项研究探讨了由多个工厂、客户和异构车辆组成的液氧供应链的生产-库存-路由综合问题（PIRP）。解决此类问题极具挑战性，尤其是在处理大规模工业规模时。本文采用两级程序，通过简化第一级中的路由部分，确定有关生产、库存和产品分配的决策。然后，在较低层次考虑路由决策，并提出 3 索引数学编程公式。为了解决低层次决策的组合复杂性，我们提出了多行程异构车辆路由问题（MTHVRP）的替代公式以及基于列生成的求解策略。一组测试实例和一项实际案例研究证明了这些公式和求解方法的适用性和性能。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Computers & Chemical Engineering 工程技术-工程：化工

CiteScore

8.70

自引率

14.00%

发文量

374

审稿时长

70 days

期刊介绍： Computers & Chemical Engineering is primarily a journal of record for new developments in the application of computing and systems technology to chemical engineering problems.