Genetic algorithms for shortest path routing

5,283 views
4,910 views

Published on

Published in: Technology
1 Comment
5 Likes
Statistics
Notes
  • plz one example in shortest path lg
       Reply 
    Are you sure you want to  Yes  No
    Your message goes here
No Downloads
Views
Total views
5,283
On SlideShare
0
From Embeds
0
Number of Embeds
2
Actions
Shares
0
Downloads
378
Comments
1
Likes
5
Embeds 0
No embeds

No notes for slide
  • Crossover probability describes how often crossover would be performed.If no crossover the new off springswould be exact copies of parents
  • Example of one point crossover ..Crossover from the 9th bit
  • 10000 shows impossible paths/ non pathsOther values are costs associated with a path
  • Crossover probability is the measure of how often crossover would be performed.More than 0.5 is optimum
  • Mutation probability (or ratio) is basically a measure of the likeness that random elements of your chromosome will be flipped into something else
  • There may be change in topology of network as some nodes may join the network or some nodes may leave the network or some nodes may fail. Under these circumstances the optimal path may no more be the shortest.Hence the network has to be refreshed at every t secondsand new routes may be generated
  • Reached optimum after 29th run
  • Genetic algorithms for shortest path routing

    1. 1. •••••••• 2
    2. 2. ••• 3
    3. 3. ••• 4
    4. 4. •••• 5
    5. 5. ••• 6
    6. 6. 7
    7. 7. • 8
    8. 8. •••• 9
    9. 9. ••• 10
    10. 10. ••• 11
    11. 11. •••• 12
    12. 12. 13
    13. 13. –––– 14
    14. 14. 15
    15. 15. ••• 16
    16. 16. ••• 0 2 3 7 9 11 12 17 18 20 0 4 5 7 10 11 13 15 16 20 17
    17. 17. • 18
    18. 18. •• 19
    19. 19. •••• 20
    20. 20. ••• 21
    21. 21. ••• 22
    22. 22. 23
    23. 23. •• 24
    24. 24. 25
    25. 25. 4.5 4 3.5COMPUTATION TIME 3 2.5 Dijistkra 2 Genetic 1.5 Algorithm 1 0.5 0 15 20 25 30 35 40 45 50 No OF NODES 26
    26. 26. 27
    27. 27. •• 28
    28. 28. •••••• 29

    ×