Akademik Veri Yönetim Sistemi
The rapid growth of e-commerce and the demand for delivery by last mile has increased the need for sustainable and cost-effective solutions. Parcel lockers have emerged as a promising innovation, yet existing research has rarely addressed mobile lockers with heterogeneous compartments in a dynamic, multi-period setting. This study introduces the Multi-Period Mobile Parcel Locker Location-Allocation Problem with Heterogeneous Compartments (MP-MPLLAP), formulated as a Zero-One Integer Programming model to minimize operational costs, including relocation expenses and customer walking penalties. To handle its computational complexity, a rolling horizon algorithm (RHA) was developed. Empirical data from a parcel locker operator in T & uuml;rkiye were used to test the model. The results reveal a critical trade-off between relocation and customer costs: restricting locker mobility reduces relocation expenses, but increases walking distances, leading to higher overall costs. Furthermore, incorporating heterogeneous compartments proved essential; assuming homogeneity caused capacity overruns while allowing flexible allocation reduced costs at the expense of computation time. The RHA achieved up to 97.3% reductions in computation time and 25.8% reductions in costs on 15 datasets, demonstrating both efficiency and effectiveness. These findings highlight the importance of jointly optimizing relocation and customer walking costs while accounting for compartment heterogeneity in locker planning. The study contributes to theory and practice by providing a realistic, empirically validated model and an efficient heuristic, offering insights for operators and urban logistics planners seeking sustainable last-mile solutions.
