An ant colony optimization algorithm for multi depot vehicle routing problems

Vehicle Routig Problem is a kind of problem that minimizes the distance covered by vehicles, starting from depot to costumer demand points. The Multi-Depot Vehicle Routing Problem (MDVRP) is a kind of problem that multiple vehicles start from multiple depots and return to their original depots at the end of their assigned tours.An Ant Colony Optimization algorithm (ACO) is a solving method which is devoloped simulating the natural behavior of ants. There are many algorithms derived from ant colony and they are used on solution of many problems.In this thesis Some of the Multi Depot Vehicle Routing Problems existing in the literature are solved using a computer program coded using C# for Ant Colony Optimization and the results are compared with optimum tour lengths of these problems.Keywords: Multi depot vehicle routing problems, Vehicle routing problems, Ant colony optimization