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...

Full description

Bibliographic Details

Published in:	Mathematics
Main Authors:	Esteban Santana Contreras, John Willmer Escobar, Rodrigo Linfati
Format:	Article
Language:	English
Published:	MDPI AG 2025-05-01
Subjects:	logistics consistent vehicle routing problem minimum service constructive heuristic tabu search social aspects of Supply Chain
Online Access:	https://www.mdpi.com/2227-7390/13/10/1553