Application of an Ant Colony System – Node (ACS – N) algorithm in the Vehicle Routing Problem (VRP)
Year: 2013
Journal of Information and Computing Science, Vol. 8 (2013), Iss. 2 : pp. 90–95
Abstract
Ant colony Optimization (ACO) is a relatively new class of metaheuristic search techniques for hard optimization problems. In this paper we focus on the definition and minimization of the objective function of the VPR using an Ant Colony System – Node (ACS – N) algorithm. The (ACS – N) algorithm is implemented for an eight node graph with respective demands. Moreover, in this paper we study the effect of the number of the ants to the value of the objective function.
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/2024-JICS-22617
Journal of Information and Computing Science, Vol. 8 (2013), Iss. 2 : pp. 90–95
Published online: 2013-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 6