IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i10p1553-d1651931.html
   My bibliography  Save this article

A Heuristic Approach for Last-Mile Delivery with Consistent Considerations and Minimum Service for a Supply Chain

Author

Listed:
  • Esteban Santana Contreras

    (School of Industrial Engineering, Universidad del Bío-Bío, Concepción 4030000, Chile)

  • John Willmer Escobar

    (Department of Accounting and Finance, Universidad del Valle, Cali 760001, Colombia)

  • Rodrigo Linfati

    (Departamento de Ingeniería Industrial, Universidad del Bío-Bío, Concepción 4030000, Chile)

Abstract

This paper considers the problem of consistent routing with minimum service (ConVRPms). ConVRPms aims to determine the minimum cost routes for each day of a planning horizon. In particular, the goal is to satisfy all individual demands and serve every customer via a single driver, with times that do not differ by more than L time units. There is a fleet of homogeneous vehicles that start from a single depot. In this paper, a heuristic algorithm for ConVRPms is proposed. The algorithm is based on classical constructive heuristics and the tabu search metaheuristic. The proposed algorithm has been tested on benchmark instances from the literature. The experimental results show that the proposed approach produces high-quality solutions within computing times considerably less than those observed with CPLEX. The proposed algorithm can optimally solve instances with 20 customers and a planning horizon of three days, producing more economical solutions in some of the larger instances and those requiring hourly consistency ( L = 1 h ).

Suggested Citation

  • Esteban Santana Contreras & John Willmer Escobar & Rodrigo Linfati, 2025. "A Heuristic Approach for Last-Mile Delivery with Consistent Considerations and Minimum Service for a Supply Chain," Mathematics, MDPI, vol. 13(10), pages 1-31, May.
    • Handle: RePEc:gam:jmathe:v:13:y:2025:i:10:p:1553-:d:1651931
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/10/1553/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/13/10/1553/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:13:y:2025:i:10:p:1553-:d:1651931. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.