This paper addresses the vehicle routing problem, a fundamental task in transportation optimization and logistics, where efficient route planning can significantly impact cost savings, service quality, and operational efficiency. The study specifically examines the performance of different route balancing measure - minmax, range, and leximin - in achieving balanced routes across multiple objectives. By implementing and analyzing these measures in MATLAB, each approach’s effectiveness in improving route balance while managing the trade-off with total traveled distance is evaluated.