Highlights Modern supply chain requires perfect synchronised exchange of containers via multiple cross-docks. This aligns with the Physical Internet concept, expected to considerably improve future logistics. A rich vehicle routing problem with that cap that captures the above concept is modelled and solved. A meta-heuristic based on Simulated Annealing was also developed. The proposed method matches best-known results in many of the large scale instances. New dataset were provided based on industry data.

    Abstract One important requirement of modern supply chain management is the frequent exchange of containers via multiple cross-docks which requires spatial and time synchronisations between different types of vehicle. Moreover, as collaborations in logistics between several companies become popular, more flexible and extended models must be solved to consider the different needs of the companies. This is of high importance in a new logistics concept, the Physical Internet, which is expected to considerably improve the way logistics are handled in the current supply chain management. To optimise the aforementioned requirements, a rich vehicle routing problem with pickup and delivery including numerous attributes is modelled and solved. A mathematical formulation is proposed and implemented in CPLEX to solve the problem. Given the complexity of the problem, solving large instances with exact methods is very time-consuming. Therefore, a multi-threaded meta-heuristic based on Simulated Annealing is developed. A set of new operators coupled with a restart strategy and memory are developed to help improve the performance. Computational results on a generated data-set showed that the proposed meta-heuristic is superior to the CPLEX solver in terms of solvability and computational time. The proposed meta-heuristic was also compared with the best-known results by current state-of-the-art methods on a classical benchmark on pickup and delivery problems with time windows (with up to 200 customers). The experimental results showed that the proposed method was able to match the best-known results in many of these large scale instances


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Toward a more flexible VRP with pickup and delivery allowing consolidations


    Beteiligte:


    Erscheinungsdatum :

    2021-02-28




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch





    Consolidations of street railways

    Vreeland, H.H. | Engineering Index Backfile | 1901


    The great consolidations called "trusts."

    Grosscup, Peter S. | Engineering Index Backfile | 1902



    Mergers, Consolidations And More-CD-ROM Companies Position For Future Market Share

    Herther, N. K. | British Library Online Contents | 1992