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

Vehicle routing problem has an important place in applied research one of vehicle routing methods consists routing with time window. In this type of routing, each customer should be served in a given time window and they are only for once allowed to visit. At the present study, Ant Colony Algorithm Optimization for Vehicle Routing Problem with Time Windows and Capacity Constraint (ACOVRPTWCC) has been utilized, and algorithm planning has been also carried out by MATLAB software. Proposed ant colony algorithm used two type of pheromone distribution, local and global.
Ant Algorithm for Vehicle routing Problem with Time Windows and vehicle Capacity Constraint classic has been implemented. In this way, of 22 problem implemented through 25 customers in 15 problems, solutions are optimized and also, of 22 problems implemented by 50 customer in 11 problems, solutions are optimized.