Distance metrics matter: analysing optimisation algorithms for the last mile problem Online publication date: Thu, 25-Feb-2021
by Jay R. Brown; Maxim A. Bushuev; Alfred L. Guiffrida
International Journal of Logistics Systems and Management (IJLSM), Vol. 38, No. 2, 2021
Abstract: This research compares and contrasts the performance of 11 optimisation algorithms and two new combined optimisation algorithms for solving the last mile delivery problem. The last mile delivery problem is modelled as a circular region with a central depot and customers randomly distributed throughout the region. The performance of the optimisation algorithms is studied with respect to expected travel distance and computation time needed to achieve a solution for problems with varying numbers of customers and where travel distance is measured with Euclidean and Manhattan distance metrics. The paper represents the first analytical comparison of different algorithms for optimising last mile delivery when the number of customers varies stochastically under both Manhattan and Euclidian distance metrics. Findings show that the number of customer deliveries and the metric used to measure travel distance impacts a decision maker's choice of the best algorithm and that employing multiple algorithms is recommended.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Logistics Systems and Management (IJLSM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook