Distribution Path Segmentation Using Route Relocation and Savings Heuristics for Multi-Depot Vehicle Routing

Abstract

This paper uses routing segmentation optimization for the planning of optimal distribution networks between urban depots and their respective customers. In this experiment, three steps are proposed in concession: search for the initial solution using local search properties, improve the solution using route relocation and perturb the solution using tabu search incorporating the savings heuristic. By applying multi-depot simultaneous deployment with ideal scheduling strategies and routing heuristics ensuring cost-optimal routing, the study presents an alternative to enhanced scheduling system optimization. Based on repopulation and sequential insertion algorithms, the initial solution is created, while route relocation and tabu swap mechanisms constitute the improvement strategy and perturbation. Test results comparing the proposed solution strategy to the previous genetic algorithm solution result in a better arrangement of route segregation aspects representing customer clusters. This strategy has proven to be more successful in optimizing route segregation than the original genetic algorithm solution. This demonstrates a significant improvement in route optimization.