Solving capacitated vehicle routing problem with a rank-based ant colony system
MetadataShow full item record
CitationNejoomi-Markid, A. ve Dolati, A. (2009). Solving capacitated vehicle routing problem with a rank-based ant colony system. Maltepe Üniversitesi. s. 69.
This study considers the application of Ant Colony Optimization (ACO) to the Capacitated Vehicle Routing Problem (CVRP), in which customers of known demand are supplied by a homogeneous fleet of vehicles from a single depot. Vehicles are subject to a weight limit, and each customer must be assigned exactly once to a vehicle. We use a combination of Ant Colony System with Rank based Ant System hybridized with saving heuristic and local search methods to solve CVRPs. Numerical experiments indicate that the proposed approach is competitive with other ACO algorithms, Simulated Annealing (SA) and Genetic Algorithm (GA). We also introduce a new best solution with route structure for CVRP instance G-n262-k25.
SourceInternational Conference of Mathematical Sciences
- Makale Koleksiyonu 
The following license files are associated with this item: