This paper introduces a novel approach to solving a practical variant of the Vehicle Routing Problem (VRP), the multi-trip VRP with heterogeneous fleet and time windows (MTVRPHFTW). The approach integrates an improved Ant Colony Optimization (IACO) metaheuristic, a modified density-based spatial clustering of application with noise (DBSCAN-Plus) clustering, and a Micro-Cluster Fusion Scheme. The proposed framework aims to optimize vehicle routes by minimizing total travelling distance and time while ensuring a fair distribution of workload among the vehicles (drivers). To evaluate the proposed algorithm, referred to as the Ant Colony Optimization (ACO) algorithm with improvement mechanisms (Cluster Improved Ant Colony Optimization, CIACO), real-world data from a logistics company in Canada was utilized. This empirical testing aims to validate the algorithm's effectiveness in practical applications. The experimental results of CIACO demonstrate that the proposed algorithm outperforms existing methods in terms of reducing traveling distance, minimizing traveling time, optimizing the use of smaller vehicles to reduce CO2 emissions, achieving balanced workloads among drivers, and improving overall route optimization.