A Heuristic Approach for Last-Mile Delivery with Consistent Considerations and Minimum Service for a Supply Chain
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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-05-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/13/10/1553 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850126055403159552 |
|---|---|
| author | Esteban Santana Contreras John Willmer Escobar Rodrigo Linfati |
| author_facet | Esteban Santana Contreras John Willmer Escobar Rodrigo Linfati |
| author_sort | Esteban Santana Contreras |
| collection | DOAJ |
| description | 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 <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>L</mi></mrow></semantics></math></inline-formula> 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 (<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>L</mi><mo>=</mo><mn>1</mn><mo> </mo><mi mathvariant="normal">h</mi></mrow></semantics></math></inline-formula>). |
| format | Article |
| id | doaj-art-2e6efea64d0f42fb9ff4e73f87e4c602 |
| institution | OA Journals |
| issn | 2227-7390 |
| language | English |
| publishDate | 2025-05-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Mathematics |
| spelling | doaj-art-2e6efea64d0f42fb9ff4e73f87e4c6022025-08-20T02:34:01ZengMDPI AGMathematics2227-73902025-05-011310155310.3390/math13101553A Heuristic Approach for Last-Mile Delivery with Consistent Considerations and Minimum Service for a Supply ChainEsteban Santana Contreras0John Willmer Escobar1Rodrigo Linfati2School of Industrial Engineering, Universidad del Bío-Bío, Concepción 4030000, ChileDepartment of Accounting and Finance, Universidad del Valle, Cali 760001, ColombiaDepartamento de Ingeniería Industrial, Universidad del Bío-Bío, Concepción 4030000, ChileThis 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 <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>L</mi></mrow></semantics></math></inline-formula> 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 (<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>L</mi><mo>=</mo><mn>1</mn><mo> </mo><mi mathvariant="normal">h</mi></mrow></semantics></math></inline-formula>).https://www.mdpi.com/2227-7390/13/10/1553logisticsconsistent vehicle routing problemminimum serviceconstructive heuristictabu searchsocial aspects of Supply Chain |
| spellingShingle | Esteban Santana Contreras John Willmer Escobar Rodrigo Linfati A Heuristic Approach for Last-Mile Delivery with Consistent Considerations and Minimum Service for a Supply Chain Mathematics logistics consistent vehicle routing problem minimum service constructive heuristic tabu search social aspects of Supply Chain |
| title | A Heuristic Approach for Last-Mile Delivery with Consistent Considerations and Minimum Service for a Supply Chain |
| title_full | A Heuristic Approach for Last-Mile Delivery with Consistent Considerations and Minimum Service for a Supply Chain |
| title_fullStr | A Heuristic Approach for Last-Mile Delivery with Consistent Considerations and Minimum Service for a Supply Chain |
| title_full_unstemmed | A Heuristic Approach for Last-Mile Delivery with Consistent Considerations and Minimum Service for a Supply Chain |
| title_short | A Heuristic Approach for Last-Mile Delivery with Consistent Considerations and Minimum Service for a Supply Chain |
| title_sort | heuristic approach for last mile delivery with consistent considerations and minimum service for a supply chain |
| topic | logistics consistent vehicle routing problem minimum service constructive heuristic tabu search social aspects of Supply Chain |
| url | https://www.mdpi.com/2227-7390/13/10/1553 |
| work_keys_str_mv | AT estebansantanacontreras aheuristicapproachforlastmiledeliverywithconsistentconsiderationsandminimumserviceforasupplychain AT johnwillmerescobar aheuristicapproachforlastmiledeliverywithconsistentconsiderationsandminimumserviceforasupplychain AT rodrigolinfati aheuristicapproachforlastmiledeliverywithconsistentconsiderationsandminimumserviceforasupplychain AT estebansantanacontreras heuristicapproachforlastmiledeliverywithconsistentconsiderationsandminimumserviceforasupplychain AT johnwillmerescobar heuristicapproachforlastmiledeliverywithconsistentconsiderationsandminimumserviceforasupplychain AT rodrigolinfati heuristicapproachforlastmiledeliverywithconsistentconsiderationsandminimumserviceforasupplychain |