This paper presents a solution approach to optimize vehicle routes for a multi-depot, multi-vehicle, pickup and delivery problem over a large ground transportation network. More precisely, we address ground transportation of orders for the Canadian Department of National Defence using heterogeneous vehicle fleets. The fleets consist of limited number of organizational vehicles hosted at pre-established depots and commercial order delivery services. The proposed approach involves leveraging an insertion cost gradient-descent heuristic followed by a greedy randomized adaptive search procedure. Experimental results generated using the historical orders of the organization indicate that the developed approach is effective in handling a wide range of scenarios and may generate near-optimal vehicle routes with an annual transportation cost reduction between 7.7% and 16.7%.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    Optimization of DND Multi-Depot Split-Load Pickup-Delivery Problem


    Beteiligte:
    Boukhtouta Abdeslem (Autor:in) / Ray Sujoy (Autor:in) / Soeanu Andrei (Autor:in) / Pall Raman (Autor:in) / Berger Jean (Autor:in)


    Erscheinungsdatum :

    2019




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Unbekannt




    Multi-Depot Pickup and Delivery Problem with Resource Sharing

    Yong Wang / Lingyu Ran / Xiangyang Guan et al. | DOAJ | 2021

    Freier Zugriff

    MULTIPLE DEPOT VEHICLE ROUTING PROBLEM WITH SPLIT DELIVERY

    Pongmanawut, Pitchaya / Likasiri, Chulin | TIBKAT | 2020



    Pickup and Delivery with Split Loads

    Nowak, M. / Ergun, O. / White, C.C. | British Library Online Contents | 2008


    Pickup and Delivery with Split Loads

    Nowak, Maciek | Online Contents | 2008