Middle-mile logistics through the lens of goal-conditioned reinforcement learning
For logistics operators, this offers a new RL-based approach to middle-mile routing, but the improvement over existing methods is unclear without specific metrics.
The paper rephrases middle-mile logistics as a multi-object goal-conditioned MDP and proposes a method combining graph neural networks with model-free RL. Results show improved routing efficiency over baselines, though concrete numbers are not provided.
Middle-mile logistics describes the problem of routing parcels through a network of hubs linked by trucks with finite capacity. We rephrase this as a multi-object goal-conditioned MDP. Our method combines graph neural networks with model-free RL, extracting small feature graphs from the environment state.