Dynamic Route Guidance Using Improved Genetic Algorithms

<table class="table-group" width="800px"><tr class="fig-image" id="a"><td><img alt="765135.fig.001a" src="https://static.hindawi.com/articles/mpe/volume-2013/765135/figures/765135.fig.001a.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(a) </b>The topology of network</td></tr></table></td></tr><tr class="fig-image" id="b"><td><img alt="765135.fig.001b" src="https://static.hindawi.com/articles/mpe/volume-2013/765135/figures/765135.fig.001b.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(b) </b>Vicinity crossover operation</td></tr></table></td></tr><tr class="fig-image" id="c"><td><img alt="765135.fig.001c" src="https://static.hindawi.com/articles/mpe/volume-2013/765135/figures/765135.fig.001c.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(c) </b>Repair the loops generated in crossover operation</td></tr></table></td></tr></table>

<table>The process of vicinity crossover operation.</table>

Mathematical Problems in Engineering

fig1

Figure 1

Figure 1: Dynamic Route Guidance Using Improved Genetic Algorithms 