2026-10-03T23:39:53Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:27813 2026-10-02T13:59:14Z ddc:004 open_access

Integrated Location-Routing-Scheduling for Multi-Trip Mobile Parcel Lockers with Time Windows (Short Paper) Essouaied, Salma Coelho, Leandro C. Wilbaut, Christophe Todosijević, Raca Mobile parcel lockers City logistics Routing and scheduling Mixed-integer programming Logic-based Benders decomposition Mobile parcel lockers can reposition delivery capacity during the day, but this flexibility requires decisions that are tightly linked: where lockers stop, which customers are assigned to each stop, how lockers move, and when service takes place. We introduce the multi-trip mobile parcel locker problem with time windows (MT-MPLP-TW), which integrates locker deployment, customer assignment, parking selection, routing, scheduling, parking capacity, walking limits, and depot replenishment. We present a compact mixed-integer programming formulation and a logic-based Benders decomposition (LBBD) that separates route-and-assignment decisions from detailed time-expanded certification. Computational results on generated instances and on the single-trip mobile parcel locker benchmark show that the compact formulation is effective on small and medium instances, while LBBD gives stronger performance on larger and more constrained cases. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Salma Essouaied and Leandro C. Coelho and Christophe Wilbaut and Raca Todosijević 2026 Is Part Of OASIcs, Volume 147, 26th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2026) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ATMOS.2026.17 urn:nbn:de:0030-drops-278132 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2026.17 eng https://creativecommons.org/licenses/by/4.0/legalcode