A variable neighborhood search approach for solving a real-world hierarchical multi-echelon vehicle routing problem involving HCT vehicles
Abstract: Highlights•A real-world VRP variant originating from a Nordic distribution company is presented.•It is solved by two versions of a GVNS algorithm; a conventional and one adaptive.•48 new benchmark instances are derived in order to test the algorithms.•Computational tests demonstrate the superiority of the adaptive algorithm.•The superiority of the adaptive algorithm is verified statistically.
External IDs:dblp:journals/cor/TadarosSM24
Loading