IDEAS home Printed from https://ideas.repec.org/a/ids/ijlsma/v38y2021i2p151-174.html
   My bibliography  Save this article

Distance metrics matter: analysing optimisation algorithms for the last mile problem

Author

Listed:
  • Jay R. Brown
  • Maxim A. Bushuev
  • Alfred L. Guiffrida

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.

Suggested Citation

  • Jay R. Brown & Maxim A. Bushuev & Alfred L. Guiffrida, 2021. "Distance metrics matter: analysing optimisation algorithms for the last mile problem," International Journal of Logistics Systems and Management, Inderscience Enterprises Ltd, vol. 38(2), pages 151-174.
    • Handle: RePEc:ids:ijlsma:v:38:y:2021:i:2:p:151-174
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=113233
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijlsma:v:38:y:2021:i:2:p:151-174. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=134 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.