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

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

Blog Article

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 Cart - Jinker 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 Back Printed Shirt 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%.