An Ant Colony Algorithm for Capacitated Vehicle Routing Problem

Qiu-ping NI, Yuan-xiang TANG, Li-yao SHI

Abstract


In this paper, we present an algorithm based on Ant Colony Algorithm (ACA) to solve the capacitated vehicle routing problem (CVRP) with simultaneous delivery task in a spatial network. The ant colony algorithm is an algorithm for finding optimal paths that is based on the behavior of ants searching for food. Simulated ants are used to construct a solution for CVRP by pheromone information from previously solutions. We develop an iterative algorithm to model the problem and an extensive numerical experiment is performed on simulated problem. It is found that ACA gives good results for CVRP.

Keywords


Logistics Distribution, Capacitated Vehicle Routing Problem, Ant Colony Algorithm.


DOI
10.12783/dtssehs/icssm2017/10409

Full Text:

PDF