Genetic Algorithm Optimization of Sales Routes with Time and Workload Objectives

Abstract

This work proposes a novel multi-objective genetic algorithm to solve the Periodic Vehicle Routing Problem with Time Windows (PVRPTWs) tailored for sales teams with diverse geographic scales and visit frequency requirements. Unlike existing models, our approach incorporates workload balancing and applies a clustering-based preprocessing step for long-distance routes using multidimensional scaling and fuzzy clustering, improving initial route grouping. When tested on three salesperson profiles (short-, mid-, and long-distance), the model achieved up to a 69% reduction in total travel time compared to a nearest neighbor baseline. These results demonstrate substantial improvements over existing methods and underscore the model’s flexibility and potential for extension to dynamic or real-time sales routing applications.