A metaheuristic approach for the problem of motor fuel distribution
Motor fuel distribution problem is considered. Accepting some assumptions it can be reduced to a well-known vechicle routing problem with capacity constraints. Ant colony optimization approach is suggested for solving CVRP. Modified ant algorithms are performed. Computational results for some benchmarks are given in compare with classical ant algorithms.