Application of an Ant Colony System – Node (ACS – N) algorithm in the Vehicle Routing Problem (VRP)

Journal Home
Volume 19 - 2024
- Vol. 19, Issue 2 pp.81-190
- Vol. 19, Issue 1 pp.1-80
Volume 18 - 2023
- Vol. 18, Issue 2 pp.81-160
- Vol. 18, Issue 1 pp.1-80
Volume 17 - 2022
- Vol. 17, Issue 2 pp.83-160
- Vol. 17, Issue 1 pp.1-80
Volume 16 - 2021
- Vol. 16, Issue 2 pp.83-159
- Vol. 16, Issue 1 pp.1-80
Volume 15 - 2020
- Vol. 15, Issue 2 pp.83-160
- Vol. 15, Issue 1 pp.1-73
Volume 14 - 2019
- Vol. 14, Issue 4 pp.243-320
- Vol. 14, Issue 3 pp.163-240
- Vol. 14, Issue 2 pp.83-160
- Vol. 14, Issue 1 pp.1-80
Volume 13 - 2018
- Vol. 13, Issue 4 pp.243-320
- Vol. 13, Issue 3 pp.163-240
- Vol. 13, Issue 2 pp.83-160
- Vol. 13, Issue 1 pp.1-80
Volume 12 - 2017
- Vol. 12, Issue 4 pp.243-320
- Vol. 12, Issue 3 pp.163-240
- Vol. 12, Issue 2 pp.83-160
- Vol. 12, Issue 1 pp.1-80
Volume 11 - 2016
- Vol. 11, Issue 4 pp.243-320
- Vol. 11, Issue 3 pp.163-240
- Vol. 11, Issue 2 pp.83-160
- Vol. 11, Issue 1 pp.1-80
Volume 10 - 2015
- Vol. 10, Issue 4 pp.243-320
- Vol. 10, Issue 3 pp.163-240
- Vol. 10, Issue 2 pp.83-160
- Vol. 10, Issue 1 pp.1-80
Volume 9 - 2014
- Vol. 9, Issue 4 pp.243-320
- Vol. 9, Issue 3 pp.163-240
- Vol. 9, Issue 2 pp.83-153
- Vol. 9, Issue 1 pp.1-80
Volume 8 - 2013
- Vol. 8, Issue 4 pp.243-320
- Vol. 8, Issue 3 pp.163-240
- Vol. 8, Issue 2 pp.83-160
- Vol. 8, Issue 1 pp.1-80
Volume 7 - 2012
- Vol. 7, Issue 4 pp.243-320
- Vol. 7, Issue 3 pp.163-240
- Vol. 7, Issue 2 pp.83-160
- Vol. 7, Issue 1 pp.1-80
Volume 6 - 2011
- Vol. 6, Issue 4 pp.243-320
- Vol. 6, Issue 3 pp.163-240
- Vol. 6, Issue 2 pp.83-160
- Vol. 6, Issue 1 pp.1-80
Volume 5 - 2010
- Vol. 5, Issue 4 pp.243-320
- Vol. 5, Issue 3 pp.163-240
- Vol. 5, Issue 2 pp.83-160
- Vol. 5, Issue 1 pp.1-80
Volume 4 - 2009
- Vol. 4, Issue 4 pp.243-320
- Vol. 4, Issue 3 pp.161-239
- Vol. 4, Issue 2 pp.83-160
- Vol. 4, Issue 1 pp.1-80
Volume 3 - 2008
- Vol. 3, Issue 4 pp.243-268
- Vol. 3, Issue 3 pp.163-224
- Vol. 3, Issue 2 pp.83-152
- Vol. 3, Issue 1 pp.1-72
Volume 2 - 2007
- Vol. 2, Issue 4 pp.243-298
- Vol. 2, Issue 3 pp.163-240
- Vol. 2, Issue 2 pp.85-160
- Vol. 2, Issue 1 pp.1-80
Volume 1 - 2006
- Vol. 1, Issue 5 pp.259-317
- Vol. 1, Issue 4 pp.195-256
- Vol. 1, Issue 3 pp.129-192
- Vol. 1, Issue 2 pp.65-128
- Vol. 1, Issue 1 pp.1-64

Volume 8, Issue 2

Aristidis Vlachos

J. Info. Comput. Sci. , 8 (2013), pp. 090-095.

[An open-access article; the PDF is free to any online user.]

Preview Full PDF 340 2531

Cited by

google scholar semantic scholar

Export citation

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.

Keywords

Ant Colony Optimization (ACO), Vehicle Routing Problem (VRP), Ant System (AS).

AMS Subject Headings

Email address

BibTex
RIS
TXT

@Article{JICS-8-090, author = {Aristidis Vlachos}, title = {Application of an Ant Colony System – Node (ACS – N) algorithm in the Vehicle Routing Problem (VRP)}, journal = {Journal of Information and Computing Science}, year = {2013}, volume = {8}, number = {2}, pages = {090--095}, 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. }, issn = {3080-180X}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jics/22617.html} }

TY - JOUR T1 - Application of an Ant Colony System – Node (ACS – N) algorithm in the Vehicle Routing Problem (VRP) AU - Aristidis Vlachos JO - Journal of Information and Computing Science VL - 2 SP - 090 EP - 095 PY - 2013 DA - 2013/06 SN - 8 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jics/22617.html KW - Ant Colony Optimization (ACO), Vehicle Routing Problem (VRP), Ant System (AS). AB - 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.

Aristidis Vlachos. (2013). Application of an Ant Colony System – Node (ACS – N) algorithm in the Vehicle Routing Problem (VRP). Journal of Information and Computing Science. 8 (2). 090-095. doi:

Copy to clipboard

BibteX RIS TXT

The citation has been copied to your clipboard

- LOGIN -

- E-mail verification -

- REGISTER -