A Modified Ant Algorithm for Solving the Vehicle Routing Problem

DOI

10.2991/iske.2007.136How to use a DOI?

Keywords

Ant Colony System, Combinatorial Optimization, Randomized Algorithm, Vehicle Routing Problem.

Abstract

The ant system is a metaheuristic developed for the solution of hard combinatorial optimization problems. In this paper, through an analysis of the constructive procedure of the solution in the Ant Colony System (ACS), a modified algorithm for solving Vehicle Routing Problem (VRP), based on the ACS Hybridized with Randomized Algorithm( HRACS), is proposed. In HRACS, only partial customers are randomly chosen to compute the transition probability. Experiments on various aspects of the algorithm and computational results for fourteen benchmark problems are reported. We compare our approach with some other meta-heuristics and show that our results are competitive.

Copyright

© 2007, 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  - Chengming Qi
PY  - 2007/10
DA  - 2007/10
TI  - A Modified Ant Algorithm for Solving the Vehicle Routing Problem
BT  - Proceedings of the 2007 International Conference on Intelligent Systems and Knowledge Engineering (ISKE 2007)
PB  - Atlantis Press
SP  - 794
EP  - 799
SN  - 1951-6851
UR  - https://doi.org/10.2991/iske.2007.136
DO  - 10.2991/iske.2007.136
ID  - Qi2007/10
ER  -