The chapter aims to provide an optimal solution to find the most suitable routes for a fleet of vehicles performing the transportation of goods by visiting a set of market hubs. Additionally, the method concentrates to minimize the empty trips that tend to cost, vehicle usage, fuel consumption, manpower, travel time, and CO2 emission, respectively, thereby avoiding long routes. Primarily, a clustering algorithm is used to classify the market hubs in the entire city and nearby cities based on a threshold time and distance. Subsequently, deciding the optimal group size, the supply depot, and the required number of vehicles to be transported at a particular time and distance is performed. The dynamic approach is possible for the entire region or state as the concluding procedure in distributing the perishable goods on time with the lowest of trash.