Search Results

Documents authored by Dietz, Emmanuelle

Document
DOI: 10.4230/LIPIcs.CP.2026.20
Scaling Industrial Logistics: Tackling Multi-Batching Problems via Sequential Solving

Authors: Emmanuelle Dietz, Guillaume Povéda, Karl Henning, and Clara Buire

Published in: LIPIcs, Volume 379, 32nd International Conference on Principles and Practice of Constraint Programming (CP 2026)

Abstract
Logistic optimization frequently involves complex routing decisions bound by tight numerical constraints such as vehicle capacities. This paper addresses a real-world industrial multi-batching problem where products must be routed between distributed sites. The objective is to determine optimal routes, travel frequencies, and packing configurations at minimum cost. The problem corresponds to a minimum cost flow problem coupled a bin packing problem. We investigate direct formalizations, decompositions, and scalable sequential approaches across three base technologies: Mixed-Integer Linear Programming, Constraint Programming, and Constraint Answer Set Programming. Our contributions are threefold: we propose a direct formalization of the problem, additional distinct approaches that scale for an industrial use case, and finally an empirical evaluation. By comparing these approaches we highlight the most effective configurations. Results suggests that a three-step approach provides the best results: combining MILP for flow routing, a greedy bin packing and CP for refinement.
Cite as

Emmanuelle Dietz, Guillaume Povéda, Karl Henning, and Clara Buire. Scaling Industrial Logistics: Tackling Multi-Batching Problems via Sequential Solving. In 32nd International Conference on Principles and Practice of Constraint Programming (CP 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 379, pp. 20:1-20:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@InProceedings{dietz_et_al:LIPIcs.CP.2026.20,
  author =	{Dietz, Emmanuelle and Pov\'{e}da, Guillaume and Henning, Karl and Buire, Clara},
  title =	{{Scaling Industrial Logistics: Tackling Multi-Batching Problems via Sequential Solving}},
  booktitle =	{32nd International Conference on Principles and Practice of Constraint Programming (CP 2026)},
  pages =	{20:1--20:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-432-1},
  ISSN =	{1868-8969},
  year =	{2026},
  volume =	{379},
  editor =	{Beldiceanu, Nicolas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2026.20},
  URN =		{urn:nbn:de:0030-drops-266534},
  doi =		{10.4230/LIPIcs.CP.2026.20},
  annote =	{Keywords: Mixed Integer Linear Programming, Constraint Programming, Discrete Optimization, Declarative Problem Solving, Industrial Logistics, Scalability, Constraint Answer Set Programming}
}
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact