Ant Colony System with Saving Heuristic for Capacitated Vehicle Routing Problem ijtsrd

The ACO heuristics is a distributed and cooperative search method that imitates the behavior of real ants in its the search for food. The Capacitated Vehicle Routing Problem CVRP is a well known combinatorial optimization problem, which is concerned with the distribution of goods between the depot and customers. This paper will apply the Ant Colony System ACS with Savings heuristic algorithm to solve Capacitated Vehicle Routing Problem. This problem will be solve to determine an optimal distribution plan that meets all the demands at minimum total cost by applying the ACS algorithm. In this paper, we consider that there is a single depot or distribution center that caters to the customer demands at a set of sales points or demand centers using vehicles with known limited capacities. The demand at each of these demand centers is assumed to be constant and known. Due to its limited capacity, the vehicles may need to make several trips from the depot for replenishment. This system will implement the transportation cost of CVRP and can find the minimum cost routes between the depot and the customers by using the Benchmarks datasets.

by Aye Aye Chaw “Ant Colony System with Saving Heuristic for Capacitated Vehicle Routing Problem”

Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-5 , August 2019,


Paper URL:

call for paper Distributed Computing, international journal Industrial Engineering, ugc approved journals Nuclear Engineering