Middle-mile logistics through the lens of goal-conditioned reinforcement learning

Onno Eberhard, Thibaut Cuvelier, Michal Valko, Bruno De Backer
5/4/2026
stat.MLcs.LG

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{eberhard2026middlemile,
  title  = {Middle-mile logistics through the lens of goal-conditioned reinforcement learning},
  author = {Onno Eberhard and Thibaut Cuvelier and Michal Valko and Bruno De Backer},
  year   = {2026},
  eprint = {2605.02461},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2605.02461v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2605.02461.svg)](https://codeofpaper.com/paper/2605.02461)

Discussion