A Heuristics-Based Parthenogenetic Algorithm for the VRP with Potential Demands and Time Windows

<table class="figure-group"><tr class="fig-image" id="a"><td><object data="https://static.hindawi.com/articles/sp/volume-2016/8461857/figures/8461857.fig.004a.svgz" name="8461857.fig.004a" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(a) </b>Single-point exchange</td></tr><tr class="fig-image" id="b"><td><object data="https://static.hindawi.com/articles/sp/volume-2016/8461857/figures/8461857.fig.004b.svgz" name="8461857.fig.004b" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(b) </b>Two-point exchange</td></tr></table>

Scientific Programming

fig4

Figure 4

Figure 4: A Heuristics-Based Parthenogenetic Algorithm for the VRP with Potential Demands and Time Windows 