Feasible Initial Population with Genetic Diversity for a Population-Based Algorithm Applied to the Vehicle Routing Problem with Time Windows

<table class="figure-group"><tr class="fig-image" id="a"><td><object data="https://static.hindawi.com/articles/mpe/volume-2016/3851520/figures/3851520.fig.005a.svgz" name="3851520.fig.005a" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(a) </b>Hamming distance: 0</td></tr><tr class="fig-image" id="b"><td><object data="https://static.hindawi.com/articles/mpe/volume-2016/3851520/figures/3851520.fig.005b.svgz" name="3851520.fig.005b" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(b) </b>Hamming distance: 1</td></tr><tr class="fig-image" id="c"><td><object data="https://static.hindawi.com/articles/mpe/volume-2016/3851520/figures/3851520.fig.005c.svgz" name="3851520.fig.005c" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(c) </b>Hamming distance: 2</td></tr><tr class="fig-image" id="d"><td><object data="https://static.hindawi.com/articles/mpe/volume-2016/3851520/figures/3851520.fig.005d.svgz" name="3851520.fig.005d" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(d) </b>Hamming distance: 3</td></tr><tr class="fig-image" id="e"><td><object data="https://static.hindawi.com/articles/mpe/volume-2016/3851520/figures/3851520.fig.005e.svgz" name="3851520.fig.005e" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(e) </b>Hamming distance: 4</td></tr></table>

<div>Proposed methodology for calculation of Hamming distance between two feasible individuals for the VRPTW.</div>

Mathematical Problems in Engineering

fig5

Figure 5

Figure 5: Feasible Initial Population with Genetic Diversity for a Population-Based Algorithm Applied to the Vehicle Routing Problem with Time Windows 

Figure 5 | Feasible Initial Population with Genetic Diversity for a Population-Based Algorithm Applied to the Vehicle Routing Problem with Time Windows 