Congested Route Management Using Genetic Algorithm : Optimization

The Proposed Algorithm Is Simple And Can Easily Be Implemented In Practice. Not Only It Is Of Lower Computational Complexity Than The GaS , But It Can Also Be Theoretically Assured To Find The Optimal Solution With Probability One As The Evolution Goes To Infinity. Coding Schemes May Also Be Altered For Faster Convergence And Increasing The Efficiency Of The Optimization Process. We Have Used One Point Crossover, Instead We May Test Multipoint Crossover. A Number Of Techniques Has Been Proposed In Various References Enlisted At The End, So We Can Test Other Intelligent Technique Like Aco, Pso, Along With Ga To Make The Technique More Robust And Efficient.Various Types Of Genetic Algorithm Techniques For Solving Network Routing And Tsp Have Been Analyzed And Surveyed Here. The Various Operators Like Mutation, Selection, Crossover And Their Combinations Used By Researchers For Finding A Solution To These Problems Have Been Discussed. The Experimental Results Of Their Works Were Also Studied And This Will Be Useful For The Comparison Between Existing Systems And Future Works. This Survey Will Serve As Future Reference For Researchers Working Under This Domain.