具有移动库存的生产路径问题
A Production Routing Problem with Mobile Inventories
AI总结:
本文研究氢气运输中的移动库存路径问题,将其建模为时间扩展图上的流问题并给出等价MILP公式,针对大规模实例提出两步启发式方法以降低计算复杂度。
摘要:
氢是一种能源载体,也是减少CO 2排放的可能途径之一。本文研究一个氢气运输问题,其中移动存储单元由卡车在需要补充的源点和需要满足需求的目的地之间移动,涉及到达时的交换操作。这与现有文献中库存保持静止不动的情况形成对比。目标是优化移动存储单元的日常路径规划和补充计划。我们将该问题建模为时间扩展图上的流问题,其中图的每个节点由时间间隔和位置进行索引,然后我们给出了该问题等价的混合整数线性规划(MILP)公式。对于中小型实例,此公式可使用标准MILP求解器高效求解。然而,对于较大型的实例,由于源点补充过程的高度组合特性,计算复杂度显著增加。为了应对这一挑战,我们提出了一种改进的两步启发式方法。
英文摘要:
Hydrogen is an energy vector, and one possible way to reduce CO 2 emissions. This paper focuses on a hydrogen transport problem where mobile storage units are moved by trucks between sources to be refilled and destinations to meet demands, involving swap operations upon arrival. This contrasts with existing literature where inventories remain stationary. The objective is to optimize daily routing and refilling schedules of the mobile storages. We model the problem as a flow problem on a time-expanded graph, where each node of the graph is indexed by a time-interval and a location and then, we give an equivalent Mixed Integer Linear Programming (MILP) formulation of the problem. For small to medium-sized instances, this formulation can be efficiently solved using standard MILP solvers. However, for larger instances, the computational complexity increases significantly due to the highly combinatorial nature of the refilling process at the sources. To address this challenge, we propose a two-step heuristic that enhances.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。