Highlights A new crowd-shipping system is studied. A Mixed Integer Nonlinear Programming model is formulated. An Adaptive Large Neighborhood Search (ALNS) heuristic is developed. The proposed ALNS outperforms CPLEX in terms of computational time. Sensitivity analyses are provided as interesting managerial insights.

    Abstract This research introduces a new variant of the vehicle routing problem in the last-mile delivery process - namely, the Crowd-Shipping Problem with Time Windows, Transshipment Nodes, and Delivery Options (CSPTW-TN-DO). Two types of fleets (i.e., dedicated vehicles and occasional drivers) are available to serve three types of customers. Type 1 customers require a home delivery. The parcel of type 2 customers must be sent to the selected alternative delivery point (ADP). Type 3 customers have the flexibility to either receive their parcel at home or at the selected ADP. Dedicated vehicles are able to serve all types of customers, whereas occasional drivers only make home deliveries. The objective of CSPTW-TN-DO is to minimize the total distribution cost of employing both fleets. We formulate a Mixed Integer Nonlinear Programming (MINLP) model for the problem and solve the model by the commercial solver CPLEX after applying a linearization process. We also propose an Adaptive Large Neighborhood Search (ALNS) to solve a set of newly generated CSPTW-TN-DO instances. The computational results indicate that the proposed ALNS provides high-quality solutions. In addition, we show that the VRPTW with a primary objective of minimizing the total distribution cost is a special case of CSPTW-TN-DO, and that the proposed ALNS achieves comparative performance to the state-of-the-art algorithms for VRPTW. After analyzing several scenarios, we conclude that simultaneously considering occasional drivers, transshipment nodes, and delivery options offers a great opportunity for a last-mile delivery system to reduce its total distribution cost.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Crowd-shipping problem with time windows, transshipment nodes, and delivery options


    Beteiligte:


    Erscheinungsdatum :

    2021-11-06




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Economics of Transshipment in Container Shipping Logistics

    Frankel, E. / Maritime & Port Authority of Singapore | British Library Conference Proceedings | 2001


    Problem of Transshipment in Travel Forecasting

    Melendez, William J. / Horowitz, Alan J. | Transportation Research Record | 2011


    The Arc Routing and Scheduling Problem with Transshipment

    De Rosa, B. / Improta, G. / Ghiani, G. et al. | British Library Online Contents | 2002


    The Arc Routing and Scheduling Problem with Transshipment

    Rosa, Barbara De | Online Contents | 2002


    Transshipment Platforms

    Pan, Xuequan | Springer Verlag | 2024