Speaker
Description
In recent years, e-commerce systems have developed considerably, and with them the number of deliveries to customers. These deliveries form the final step of the logistics chain, known as last-mile delivery. Within this layer, turning orders into vehicle routes still rests on human expertise: consultations with dispatchers and drivers of courier companies and retailer-owned fleets confirm that routes are built manually and empirically, relying on years of experience. This paper models that decision computationally, formalizing what an automated planner must reproduce from current practice. The underlying problem is the Multi-Trip Heterogeneous Fleet Capacitated Vehicle Routing Problem (MT-HFCVRP), NP-hard as an extension of the Traveling Salesman Problem, which becomes a mixed-integer nonlinear programming (MINLP) problem once compactness, a property of the stop-to-vehicle assignment, is included. Dispatchers achieve compactness intuitively but explore few alternatives, while well-known solvers optimize distance, time and capacity across a vast search space, yet have no native way to express compactness. A hybrid heuristic is therefore proposed that refines an OR-Tools solution through a compactness-preserving local search, under a monetary cost objective calibrated on national transport rates. The approach is evaluated on anonymized real deliveries from an operational week of the largest DIY e-commerce retailer in Romania, with scalability assessed on synthetic instances, against the dispatchers' allocations, a distance-optimal reference and established solvers.