Open Access   Article Go Back

Optimization Of ACO-GA for Routing Optimization

AK Vajpayee1 , SM. Faisal2

  1. Project Head and CTO, SGS Professional Pvt. Ltd., Lucknow, India.
  2. Dept. of Computer Science, Integral University, Lucknow, India.

Correspondence should be addressed to: abhaytherock@gmail.com.

Section:Research Paper, Product Type: Journal Paper
Volume-5 , Issue-5 , Page no. 101-104, May-2017

Online published on May 30, 2017

Copyright © AK Vajpayee, SM. Faisal . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: AK Vajpayee, SM. Faisal, “Optimization Of ACO-GA for Routing Optimization,” International Journal of Computer Sciences and Engineering, Vol.5, Issue.5, pp.101-104, 2017.

MLA Style Citation: AK Vajpayee, SM. Faisal "Optimization Of ACO-GA for Routing Optimization." International Journal of Computer Sciences and Engineering 5.5 (2017): 101-104.

APA Style Citation: AK Vajpayee, SM. Faisal, (2017). Optimization Of ACO-GA for Routing Optimization. International Journal of Computer Sciences and Engineering, 5(5), 101-104.

BibTex Style Citation:
@article{Vajpayee_2017,
author = {AK Vajpayee, SM. Faisal},
title = {Optimization Of ACO-GA for Routing Optimization},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {5 2017},
volume = {5},
Issue = {5},
month = {5},
year = {2017},
issn = {2347-2693},
pages = {101-104},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=1271},
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=1271
TI - Optimization Of ACO-GA for Routing Optimization
T2 - International Journal of Computer Sciences and Engineering
AU - AK Vajpayee, SM. Faisal
PY - 2017
DA - 2017/05/30
PB - IJCSE, Indore, INDIA
SP - 101-104
IS - 5
VL - 5
SN - 2347-2693
ER -

VIEWS PDF XML
653 530 downloads 520 downloads
  
  
           

Abstract

For network routing optimization many protocols and methods are evolved over time and this continuous race for more accurate and speedy data delivery is going on, our research is also one attempt on that race. Nature is best knowledge available on this planet, so ignoring this available science on any field would be foolish. Ants are social insects that searches food collectively and passed their knowledge of food path to others by leaving a hormone called pheromone on the way; researches used this earlier solely and with Genetics for routing optimization. Combination of both is used in routing optimization where output of GA is passed on ACO algorithm but we proposed to use firstly ACO and then passed the output of ACO in GA to get possible path. By our approach we not only reduced the domain of routes for GA but also optimized the time, every time GA uses for evolving best set of chromosomes. We just not only optimized the routing but also optimized earlier research of combination of ACO and GA.

Key-Words / Index Term

Ant Colony Optimization , Genetic Algorithm, Routing Optimization, Meta-Heuristic

References

[1] GD. Caro, M. Dorigo, “Ant colonies for Adaptive Routing in Packet-Switched Communications Networks”, International Conference on Parallel Problem Solving from Nature, USA, pp 673-682 , 2006
[2] M. Dorigo, “Optimization, Learning and Natural Algorithms”, PhD thesis from Politecnico di Milano, Italy, pp.1-13, 1992,
[3] V.K. Ojha, A. Abraham, V. Snasel, “ACO for Continuous Function Optimization: A Performance Analysis”, 14th International Conference on Intelligent Systems Design and Applications (ISDA), Japan, pp.145-150, 2014.
[4] GD. Caro, M. Dorigo, “AntNet : Distributed Stigmergetic Control For Communications Network”, Journal of Artificial Intelligence Research, Vol.9, Issue.1, pp.317-365, 1998.
[5] X. Wang, J. Ma, J. Wang, “Parallel energy-efficient coverage optimization with maximum entropy clustering in wireless sensor networks”, Journal of Parallel and Distributed Computing, Vol.69, Issue.10, pp.838-847, 2007.
[6] C.Saliba, RA. Farrugia, “Quality of Service Aware Ant Colony Optimization Routing Algorithm”, 15th IEEE Conference on Mediterranean Electrotechnical, Valletta, pp.343-347, 2010.
[7] G.D. Caro, M. Dorigo, “AntNet: a mobile agents approach to adaptive routing”, Proceedings of the Thirty-First Hawaii International Conference on System Science, Belgium, pp.74-83, 1998.
[8] M. Kaur, M. Agnihotri, "A Hybrid Technique Using Genetic Algorithm and ANT Colony Optimization for Improving in Cloud Datacenter", International Journal of Computer Sciences and Engineering, Vol.4, Issue.8, pp.100-105, 2016.
[9] D. Mukherjee, S. Acharyya, “Ant Colony Optimization Technique Applied in Network Routing Problem”, International Journal of Computer Applications, Vol.1, Issue.15, pp.66-73, 2012.
[10] M. Dorigo, “From Ant Colonies to Artificial Ants : First International Workshop on Ant Colony Optimization”, AI Communication. Vol.11, Issue.3, pp.39-42, 2000.
[11] T. Stützle, “Parallelization Strategies for Ant Colony Optimization”, Proceedings of Fifth International Conference on Parallel Problem Solving from Nature, Springer-Verlag, Barlin, pp.722-731, 1998.
[12] K. Deb, “An efficient constraint-handling method for genetic algorithms”, Comput. Methods Appl. Mech. Eng., vol.186, No.2, pp. 311-338, 2000.
[13] Yuanyuan Zhang, “Multi-Objective Search - based Requirements Selection and ptimisation”, Ph.D Thesis of King’s College-University of London, London, pp.1- 276, 2010.
[14] J. Gu, J. Hu, T. Zhao, G. Sun, “A new resource scheduling strategy based on genetic algorithm in cloud computing environment”, Journal of Computers, Vol.7, No.1, pp.42-52, 2012.
[15] Abdul Kadar Muhammad Masum ,”Solving the Vehicle Routing Problem using Genetic Algorithm”, (IJACSA) International Journal of Advanced Computer Science and Applications, Vol. 2, No. 7, pp.126-131, 2011.