An evolutionary algorithm approach for the constrained multi-depot vehicle routing problem

Abstract

Purpose

The purpose of this paper is to explore a real world vehicle routing problem (VRP) that has multi-depot subcontractors with a heterogeneous fleet of vehicles that are available to pickup/deliver jobs with varying time windows and locations. Both the overall job completion time and number of drivers utilized are analyzed for the automated job allocations and manual job assignments from transportation field experts.

Design/methodology/approach

A nested genetic algorithm (GA) is used to automate the job allocation process and minimize the overall time to deliver all jobs, while utilizing the fewest number of drivers – as a secondary objective.

Findings

Three different real world data sets were used to compare the results of the GA vs transportation field experts’ manual assignments. The job assignments from the GA improved the overall job completion time in 100 percent (30/30) of the cases and maintained the same or fewer drivers as BS Logistics (BSL) in 47 percent (14/30) of the cases.

Originality/value

This paper provides a novel approach to solving a real world VRP that has multiple variants. While there have been numerous models to capture a select number of these variants, the value of this nested GA lies in its ability to incorporate multiple depots, a heterogeneous fleet of vehicles as well as varying pickup times, pickup locations, delivery times and delivery locations for each job into a single model. Existing research does not provide models to collectively address all of these variants.

Citation

Lightner-Laws, C., Agrawal, V., Lightner, C. and Wagner, N. (2016), "An evolutionary algorithm approach for the constrained multi-depot vehicle routing problem", International Journal of Intelligent Computing and Cybernetics, Vol. 9 No. 1, pp. 2-22. https://doi.org/10.1108/IJICC-06-2015-0018