| Using Ant Colony Optimization Algorithm for Solving Vehicle Routing Problem
Vehicle routing problem (VRP) is defined as generating routes to optimize total distance and total cost where each route starts and ends at the depot, and each customer is constrainted to be visited once.
VRP is one of the difficult and time consuming optimization problems. Hence, heuristic and metaheuristic methods are generally used to solve the VRP in academic literature.
In this study, Capacitated Vehicle Routing Problem (CVRP), which is the topic of the researches frequently, is considered. A solution is proposed to CVRP by using one of the metaheuristic methods, Ant Colony System (ACS). The method is performed on the literature benchmark problems and the obtained solutions are compared with the best known solutions.
Dostları ilə paylaş: | 
