Optimization of DND Multi-Depot Split-Load Pickup-Delivery Problem
Boukhtouta Abdeslem, Ray Sujoy, Soeanu Andrei and 2 more
MATEC Web of Conferences · 2019
doi:10.1051/matecconf/201929602009 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
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%.
Abstract licence: CC BY
References13
13 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.