A Production Routing Problem with Mobile Inventories

Abstract

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.