• Ashima Gupta
• Sanjay Saini

This article presents an enhanced ant colony optimization (eACO) algorithm for solving the capacitated vehicle routing problem (CVRP). CVRP is the core component of VRP, and also a difficult combinatorial optimization problem. An enhanced ACO algorithm is implemented on five CVRP benchmark problems, improving several of the best-so-far results existing in the literature. The computational results show that the enhanced heuristic can produce optimal solutions when compared to other existing heuristics. Results indicate that the proposed heuristic is an alternative to solve CVRP.

Capacitated vehicle routing problem, CVRP, heuristics, enhanced ACO, optimization, optimal solution.

"Novel Solutions for Capacitated Vehicle Routing Problem using an Ant Colony Optimization Algorithm", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 9, page no.260-271, September-2018, Available :http://www.jetir.org/papers/JETIR1809054.pdf

"Novel Solutions for Capacitated Vehicle Routing Problem using an Ant Colony Optimization Algorithm", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 9, page no. pp260-271, September-2018, Available at : http://www.jetir.org/papers/JETIR1809054.pdf