“…Albrecht (2006, 2008) import logarithmic simulated annealing (LSA) as pre-processing of GA; the algorithm utilizes the partially crossover operation (PMX) under the elitist model and the landscape analysis is presented to estimate the depth of the deepest local minimal in the landscape generated by the routing tasks and the objective function; experimental results show that the algorithm is effective on the randomly generated networks. Yang, Xu, Li, and Liu (2004) and Ikeda et al (2006) focus on creating a robust path to find solution for specified networks; the genetic algorithm is proposed and, respectively, the individuals of the population are represented by trees, algorithm uses the single point crossover and a mutation operation where the ''tree junctions" are chosen randomly, the algorithm employs the elitist model where the individual with the highest fitness value in a population is left unchanged in the next generation, the simulation results show that the algorithm is reasonably fast on small and medium size networks. Differ from the above network architecture, Rango, Tropea, Santamaria, and Marano (2007) and Mala and Swlvakumar (2006) refer a scheme called Core Based Tree (CBT) with genetic algorithm which provides a new way for realizing multicast routing protocol in wireless networks, however, it needs much running time.…”