Improved Ant System Algorithm and its Application for Vehicle Routing Problem

DOI

10.2991/wartia-16.2016.304How to use a DOI?

Keywords

ACS, C-W, VNS, CVRP

Abstract

The Ant Colony System combined with Variable Neighborhood Search (VNS-ACS) was proposed to relieve the limitations of typical Ant Colony Algorithm (ACA) vulnerable to stagnation and random results. Based on the idea of ACS algorithm, VNS-ACS algorithm improves the path search strategy and the local path optimization by combining with Clark-Wright saving algorithm (C-W), roulette algorithm, VNS and segment setting parameters. Accordingly it can make deterministic and stochastic equilibrium, consequently improving the global optimization ability of the algorithm, convergence speed and stability. Several experimental results in the vehicle routing problem are presented to demonstrate its advantages over ACS in the optimal path accuracy and reliability of the algorithm.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Lulu Zhai
AU  - Iqbal Muhammad Ather
AU  - Zhijie Wang
AU  - Qianqian Zheng
PY  - 2016/05
DA  - 2016/05
TI  - Improved Ant System Algorithm and its Application for Vehicle Routing Problem
BT  - Proceedings of the 2016 2nd Workshop on Advanced Research and Technology in Industry Applications
PB  - Atlantis Press
SP  - 1494
EP  - 1499
SN  - 2352-5401
UR  - https://doi.org/10.2991/wartia-16.2016.304
DO  - 10.2991/wartia-16.2016.304
ID  - Zhai2016/05
ER  -