Cost balancing act of vehicle number to solve the Vehicle Routing Problem with time windows

The Vehicle Routing Problem lies at the heart of distribution management. There are several versions of the problem, and a wide variety of exact and approximate algorithms have been proposed for its solution. This paper introduces a decision-making approach for selecting the optimal number of vehicles used in solving the vehicle routing problem with (without) time conditions. To solve the VRP problem, we use and modify the Ant Colony Optimization (ACO) algorithm.