Logistics Service Providers (LSP) are increasingly adopting Automated Parcel Lockers (APLs) to mitigate the operational pressure of last-mile logistics. The optimal location of APL stations is key for reaching customers’ demand while keeping the investment reasonable. Previous studies developed optimization algorithms and applied them to virtual instances of the problem, lacking applicability to real-life situations encountered by LSPs who aim to serve an urban area with such technology. This study proposes a novel solution to the APLs location problem by combining mixed-integer linear programming and greedy heuristics algorithms. The study tested the propose solution on real customers’ demand data related to Turin, Italy. Results show that covering 90% of the estimated potential demand requires 10 to 11 APLs, on average. The adopted approach enables finding an optimal solution grounded in a real geographical context without requiring time-consuming optimization.


    Access

    Download


    Export, share and cite



    Title :

    Locating Automated Parcel Lockers (APL) with known customers’ demand: a mixed approach proposal


    Contributors:


    Publication date :

    2023




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown




    Flexible parcel delivery to automated parcel lockers: models, solution methods and analysis

    Orenstein, Ido / Raviv, Tal / Sadan, Elad | Online Contents | 2019


    Do parcel lockers reduce delivery times? Evidence from the field

    Ranjbari, Andisheh / Diehl, Caleb / Dalla Chiara, Giacomo et al. | Elsevier | 2023


    Deploying autonomous mobile lockers in a two-echelon parcel operation

    Li, Jun / Ensafian, Hamidreza / Bell, Michael G.H. et al. | Elsevier | 2021


    Spatial accessibility and equity analysis of Amazon parcel lockers facilities

    Schaefer, Jaclyn S. / Figliozzi, Miguel A. | Elsevier | 2021


    Location Optimization for Community Smart Parcel Lockers Based on Bilevel Programming

    Xia Yang / Chenyang Wang / Xiaozheng He et al. | DOAJ | 2023

    Free access