Parameter Tuning for Local-Search-Based Matheuristic Methods

<table class="figure-group"><tr class="fig-image" id="a"><td><object data="https://static.hindawi.com/articles/complexity/volume-2017/1702506/figures/1702506.fig.003a.svgz" name="1702506.fig.003a" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(a) </b>Clients distributed in clusters</td></tr><tr class="fig-image" id="b"><td><object data="https://static.hindawi.com/articles/complexity/volume-2017/1702506/figures/1702506.fig.003b.svgz" name="1702506.fig.003b" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(b) </b>Clients uniformly distributed</td></tr></table>

<div>Example of the instances considered in this study.</div>

Complexity

fig3

Figure 3

Figure 3: Parameter Tuning for Local-Search-Based Matheuristic Methods 