Title
An illumination algorithm approach to solving the micro-depot routing problem
Abstract
ABSTRACTAn increasing emphasis on reducing pollution and congestion in city centres combined with an increase in online shopping is changing the ways in which logistics companies address vehicle routing problems (VRP). We introduce the micro-depot-VRP, in which a single supply vehicle is used to supply a set of micro-depots distributed across a city; deliveries are then made from the micro-depot by couriers using electric vehicles, bicycles and on foot. We present a formal definition of the problem, and propose a representation that can be used with an optimisation algorithm to minimise the total cost associated with delivering packages. Using five instances created from real-data obtained from delivery companies operating within the City of Frankfurt, we apply an illumination algorithm in order to obtain a set of results that minimise costs but have differing characteristics in terms of emissions, distance travelled and number of couriers used. Results show that solutions can be obtained that have equivalent costs to the baseline standard VRP solution, but considerably improve on this in terms of minimising the secondary criteria relating to emissions, couriers and distance.
Year
DOI
Venue
2019
10.1145/3321707.3321767
Genetic and Evolutionary Computation Conference
Keywords
Field
DocType
Vehicle Routing, Quality-Diversity Algorithms
Mathematical optimization,Computer science,Depot
Conference
Citations 
PageRank 
References 
0
0.34
0
Authors
3
Name
Order
Citations
PageRank
neil b urquhart18314.70
Silke Höhl200.34
Emma Hart353644.74