Development of Vehicle Routing Problem (VRP) Models in Python to Optimize Last-Mile Distribution Routes in an SME

Small and medium-sized enterprises (SMEs) that produce perishable food often plan last-mile distribution reactively, which raises fuel consumption, extends working days and forces vehicles to return to the plant for additional product. This study develops and evaluates vehicle routing problem (VRP) models implemented in Python for a family-owned cheese SME located in Apaxco de Ocampo, State of Mexico, which serves about 35 commercial destinations per day with more than 900 kg of product using two light trucks of 600 and 800 kg. The research followed the Design Thinking approach in five phases. The empathize and define phases characterized the current operation, three delivery corridors and the isolated fuel cost of each destination. The ideate phase formulated a heterogeneous capacitated VRP with working-day limits, multiple trips and order release times. The prototype phase implemented the model in Python using a Clarke-Wright savings heuristic, a simulated annealing metaheuristic and an exact mixed-integer verification solved with HiGHS. In the test phase, three scenarios were compared under identical orders, vehicles and assumptions: the current dispatching rules, a static scenario with all orders ready at 07:00 and a dynamic scenario with staggered production releases. Under the dynamic scenario, the model reduced the travelled distance from 382.0 to 285.4 km (25.3 %), daily fuel cost from MXN 1,293 to MXN 966, trips from six to four and minutes beyond the working day by 61.2 %. When production and dispatch were synchronized, distance fell to 152.8 km (60.0 %) with two trips and no overtime. A Monte Carlo experiment with 30 simulated days yielded a mean distance reduction of 35.1 %, and the exact verification confirmed the optimal sequence of every route. The results show that route optimization must be accompanied by the synchronization of production and dispatch.

Authors

Institutions

Publication Details

Journal
International Journal of Research and Innovation in Social Science
Published
2026-11-14
DOI
https://doi.org/10.47772/ijriss.2026.102500010
Primary Topic
Vehicle Routing Optimization Methods
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Development of Vehicle Routing Problem (VRP) Models in Python to Optimize Last-Mile Distribution Routes in an SME

Maya Bautista Jukari, Navarro Ordoñez Diana Mariel, Rivera Escalante Daniel, Acosta Martínez Nayeli Abigail et al.
International Journal of Research and Innovation in Social Science
Vehicle Routing Optimization Methods
article

Development of Vehicle Routing Problem (VRP) Models in Python to Optimize Last-Mile Distribution Routes in an SME

Maya Bautista Jukari, Navarro Ordoñez Diana Mariel, Rivera Escalante Daniel, Acosta Martínez Nayeli Abigail, Meneses Sánchez Valeria
article en

Abstract

Small and medium-sized enterprises (SMEs) that produce perishable food often plan last-mile distribution reactively, which raises fuel consumption, extends working days and forces vehicles to return to the plant for additional product. This study develops and evaluates vehicle routing problem (VRP) models implemented in Python for a family-owned cheese SME located in Apaxco de Ocampo, State of Mexico, which serves about 35 commercial destinations per day with more than 900 kg of product using two light trucks of 600 and 800 kg. The research followed the Design Thinking approach in five phases. The empathize and define phases characterized the current operation, three delivery corridors and the isolated fuel cost of each destination. The ideate phase formulated a heterogeneous capacitated VRP with working-day limits, multiple trips and order release times. The prototype phase implemented the model in Python using a Clarke-Wright savings heuristic, a simulated annealing metaheuristic and an exact mixed-integer verification solved with HiGHS. In the test phase, three scenarios were compared under identical orders, vehicles and assumptions: the current dispatching rules, a static scenario with all orders ready at 07:00 and a dynamic scenario with staggered production releases. Under the dynamic scenario, the model reduced the travelled distance from 382.0 to 285.4 km (25.3 %), daily fuel cost from MXN 1,293 to MXN 966, trips from six to four and minutes beyond the working day by 61.2 %. When production and dispatch were synchronized, distance fell to 152.8 km (60.0 %) with two trips and no overtime. A Monte Carlo experiment with 30 simulated days yielded a mean distance reduction of 35.1 %, and the exact verification confirmed the optimal sequence of every route. The results show that route optimization must be accompanied by the synchronization of production and dispatch.

International Journal of Research and Innovation in Social ScienceVol. 10(25)
Instituto Tecnológico de Toluca (MX)
Vehicle Routing Optimization Methods
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon