DROPS

Document

DOI: 10.4230/LIPIcs.CP.2026.36

Optimizing a Multi-Commodity Home-Delivery and Pickup Service in Depopulated Rural Areas with Constraint Programming

Authors: Ryo Kuroiwa, Tomoki Hasegawa, Eiji Ueda, Naoki Akiyama, and Akira Yoshioka

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

Abstract

We study a routing problem for delivering and picking up multiple commodities with different priorities, motivated by the need to provide basic services to people in depopulated rural areas with a driver shortage. We define our problem as a generalization of the team orienteering problem with time windows, with additional constraints motivated by real-world applications. We develop constraint programming (CP) and mixed-integer programming (MIP) models to solve the formulated problem. In addition, we propose an incremental warm-starting strategy, which obtains an initial solution by solving a problem considering only a subset of commodities. In our experiment, CP outperforms MIP, and incremental warm-starting improves the performance of both approaches.

Cite as

Ryo Kuroiwa, Tomoki Hasegawa, Eiji Ueda, Naoki Akiyama, and Akira Yoshioka. Optimizing a Multi-Commodity Home-Delivery and Pickup Service in Depopulated Rural Areas with Constraint Programming. In 32nd International Conference on Principles and Practice of Constraint Programming (CP 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 379, pp. 36:1-36:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@InProceedings{kuroiwa_et_al:LIPIcs.CP.2026.36,
  author =	{Kuroiwa, Ryo and Hasegawa, Tomoki and Ueda, Eiji and Akiyama, Naoki and Yoshioka, Akira},
  title =	{{Optimizing a Multi-Commodity Home-Delivery and Pickup Service in Depopulated Rural Areas with Constraint Programming}},
  booktitle =	{32nd International Conference on Principles and Practice of Constraint Programming (CP 2026)},
  pages =	{36:1--36:22},
  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.36},
  URN =		{urn:nbn:de:0030-drops-266689},
  doi =		{10.4230/LIPIcs.CP.2026.36},
  annote =	{Keywords: Application, Operations Research \& Mathematical Optimisation}
}

Search Results

Documents authored by Ueda, Eiji

Optimizing a Multi-Commodity Home-Delivery and Pickup Service in Depopulated Rural Areas with Constraint Programming

Abstract

Cite as

Thanks for your feedback!

Could not send message