Ant Colony Algorithm Optimization for Vehicle Routing Problem with Time Windows and Capacity Constraint

Vehicle routing problem has an important place in applied research. Finding the right path to solve Vehicles Routing Problem is one of the most significant measures taken in recent decades. In this routing method, each delivery must be made within time windows, and not to mention the fact that each customer must be visited only once. At the present paper, Ant Colony Algorithm Optimization for Vehicle Routing Problem with Time Windows and Capacity Constraint (ACOVRPTWCC) has been utilized. First, Ant Algorithm for Vehicle routing Problem with Time Windows and vehicle Capacity Constraint classic has been implemented. In this way, of 9 problem implemented through 100 customers in 6 problems, solutions are optimized. Then, algorithm is carried out on a new type of vehicle routing problem with time window. The most decrease of cost related to R206 problem by 32.72 percent minimization of cost. For any problem, on the average, 20 second time is needed.