| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 486350 | Procedia Computer Science | 2014 | 8 Pages |
Abstract
Motor fuel distribution problem is considered. Accepting some assumptions it can be reduced to a well-known vehicle 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 algorithm.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
