A Novel Routing Protocol for Realistic Traffic Network Scenarios in VANET

Algorithm 4

Proposed GAACO for optimizing parameter.

  Input:AS swarm size (total number of ants)

    initial location of ant ∀ L ⋲ {1, 2, 3,……,l}

    I_tr used for iteration number {20-40}

 Output: Optimized route

1.   Set I_tr =0, gen =0;

2.   Initialize GA, ACO

3.     Call Algorithm 5(GA for swarm position)

4.       Max(generation)

5.       Gen++

6.       Continue;

7.     End for

8.    Initialize pheromone

9.   ForI_tr 1 to T

10.       ++;

11.       Update(pheromone);

12.   End for

13.   Return optimized_solution;