Advance ACS Using Chaos Searching Technique (Case Study: ACS-Based Network Routing Algorithms) | ||
| journal of kerbala university | ||
| Article 1, Volume 10, Issue 0, January 2014, Pages 67-74 PDF (0 K) | ||
| Author | ||
| Soukaena Hassan Hashem | ||
| Abstract | ||
| In this paper a hybrid algorithm by combining the Ant Colony System (ACS) with Chaos Search (CS) is presented to enhance ACS (case study ACS-based network routing algorithms). The hybrid algorithm is injecting CS into ACS by initializing the algorithm with a set of random ants that travels in search space from source to destination. Then an optimization is obtained by CS to distinguish whither ant is feasible or not. That proposed model called (H-T-S-C). In each of iterations all feasible ants are ranked in ascending order. Ants in the front of the list are updated by ACS, while ants in the end of list are updated by CS. CS used here is not only to enhance the ants but also to improve the diversity of ant swarm so as to avoid ACS trapping the local optima. The results showed that the hybrid algorithm increased Message Delivery Ratio (MDR) about 10%, decreased jitter about 10%, decreased congestion about 5% and decreased time of search about 3%. | ||
| Keywords | ||
| Chaos Search; ACS; stagnation; Hybrid Algorithm; Network Routing Algorithm | ||
|
Statistics Article View: 110 PDF Download: 49 |
||