Highlights We solve a routing and scheduling problem with uncertain customer presence. This problem arises in e-commerce last-mile deliveries. Customer presence data are taken into account in our methodology. The problem is solved by adaptive large neighborhood search. Accounting for customer-related presence.

    Abstract The recent increase in online orders in e-commerce leads to logistical challenges such as low hit rates (proportion of successful deliveries). We consider last-mile vehicle routing and scheduling problems in which customer presence probability data are taken into account. The aim is to reduce the expected cost resulting from low hit rates by considering both routing and scheduling decisions simultaneously in the planning phase. We model the problem and solve it by the means of an adaptive large neighborhood search metaheuristic which iterates between the routing and scheduling components of the problem. Computational experiments indicate that using customer-related presence data significantly can yield savings as large as 40% in system-wide costs compared with those of traditional vehicle routing solutions.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Optimizing e-commerce last-mile vehicle routing and scheduling under uncertain customer presence




    Publication date :

    2021-01-30




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Optimizing e-commerce last-mile vehicle routing and scheduling under uncertain customer presence

    Ozarik, Sami / Veelenturf, Luuk P. / van Woensel, Tom et al. | BASE | 2021

    Free access

    Routing and Scheduling for a Last-Mile Transportation System

    Wang, Hai | British Library Online Contents | 2019


    Rich vehicle routing problem with last-mile outsourcing decisions

    Alcaraz, Juan J. / Caballero-Arnaldos, Luis / Vales-Alonso, Javier | Elsevier | 2019