This research provides an adaptive artificial bee colony algorithm (AABC) to handle the goods transportation routing problem based on available capacity of vehicles well-known as Capacitated Vehicle Routing Problem (CVRP). The proposed algorithm is developed from the traditional artificial bee colony algorithm to approve a good performance and quality solution. This algorithm was verified through VRP Benchmark problems by comparing the results with existing Best Known Solutions (BKS) of the Capacitated VRP benchmark. The experimental results found that AABC can nearly confirm the good performances as compared with benchmark problem of Augerat et al. that can success the short running time and receive average nearest values.
