Embedding Malaysian House Red Ant Behavior into an Ant Colony System
Z. A. Othman, H. M. Rais and A. R. Hamdan
DOI : 10.3844/jcssp.2008.934.941
Journal of Computer Science
Volume 4, Issue 11
Problem statement: Ant Colony System (ACS) is the most popular algorithm used to find a shortest path solution in Traveling Salesman Problem (TSP). Several ACS versions have been proposed which aim to achieve an optimum solution by adjusting pheromone levels. However, it still has a room on an improvement. This research aims to improve the algorithm by embedding individual Malaysian House Red Ant behavior into ACS. Approach: Modeling individual ants
© 2008 Z. A. Othman, H. M. Rais and A. R. Hamdan. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.