Abstract Collaborative vehicle routing of multiple logistics providers is an important component of horizontal logistic collaboration that generates economic and societal benefits. Existing research on collaborative vehicle routing is limited to the homogeneous setting where the logistics providers transport the same product. To better address the need of a general modeling framework and fast computational methods for the growth of collaboration among logistics providers carrying various products, we investigate a heterogeneous multi-depot collaborative vehicle routing problem (HMCVRP) in this paper. The key operational and computational challenge of realizing the collaborative route planning is to properly select transfer points for product transshipment between vehicles of different depots. We propose a Benders-based branch-and-cut algorithm with the technique of combinatorial Benders’ cuts to solve a mixed-integer programming formulation of HMCVRP. Numerical experiments indicate that the proposed algorithm significantly outperforms the CPLEX solver using the commonly adopted big-M transformation-based method. Additional computational study further reveals the importance of the locations of depots and having a well-designed cost savings allocation mechanism in practice.

    Highlights The heterogeneous multi-depot collaborative vehicle routing problem is studied. Collaboration is realized via transshipment at the customer locations and depots. A Benders-based branch-and-cut algorithm is developed to solve this problem. Algorithm is enhanced with Combinatorial benders’ cuts and enhancement strategies. We provide some important operational insights of heterogeneous collaboration.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Heterogeneous multi-depot collaborative vehicle routing problem


    Beteiligte:
    Zhang, Qihuan (Autor:in) / Wang, Ziteng (Autor:in) / Huang, Min (Autor:in) / Yu, Yang (Autor:in) / Fang, Shu-Cherng (Autor:in)


    Erscheinungsdatum :

    2022-03-19


    Format / Umfang :

    20 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Selective multi-depot vehicle routing problem with pricing

    Aras, Necati / Aksen, Deniz / Tuğrul Tekin, Mehmet | Elsevier | 2010



    A tabu search heuristic for the multi-depot vehicle routing problem

    Renaud, Jacques / Laporte, Gilbert / Boctor, Fayez F. | TIBKAT | 1994


    Heuristic for Min-Max Heterogeneous Multi-Vehicle Multi-Depot Traveling Salesman Problem

    Kumar, Deepak Prakash / Rathinam, Sivakumar / Darbha, Swaroop et al. | AIAA | 2024


    Multi-depot multi-trip vehicle routing problem with time windows and release dates

    Zhen, Lu / Ma, Chengle / Wang, Kai et al. | Elsevier | 2020