This web application solves the Capacitated Vehicle Routing Problem using Ant Colony Optimization
A CVRP consists of one warehouse and several nodes each of which has a demand to be fulfilled by delivery trucks based in the warehouse. These trucks will have a maximum capacity. The objective of solving this problem is to find the minimum number of routes which will add up to having the minimum total distance which will also maximize the utilization of truck capacity. This in turn would ensure the least distribution cost for the company.
