Application of Multiple-Population Genetic Algorithm in Optimizing the Train-Set Circulation Plan Problem

<table class="figure-group"><tr class="fig-image" id="a"><td><object data="https://static.hindawi.com/articles/complexity/volume-2017/3717654/figures/3717654.fig.0014a.svgz" name="3717654.fig.0014a" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(a) </b>Comparison of train-sets amount</td></tr><tr class="fig-image" id="b"><td><object data="https://static.hindawi.com/articles/complexity/volume-2017/3717654/figures/3717654.fig.0014b.svgz" name="3717654.fig.0014b" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(b) </b>Comparison of maintenance amount</td></tr><tr class="fig-image" id="c"><td><object data="https://static.hindawi.com/articles/complexity/volume-2017/3717654/figures/3717654.fig.0014c.svgz" name="3717654.fig.0014c" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(c) </b>Comparison of computational time</td></tr></table>

<div>Comparison of three different algorithms.</div>

Complexity

fig14

Figure 14

Figure 14: Application of Multiple-Population Genetic Algorithm in Optimizing the Train-Set Circulation Plan Problem 