An Efficient Two-Objective Hybrid Local Search Algorithm for Solving the Fuel Consumption Vehicle Routing Problem

<table class="figure-group"><tr class="fig-image" id="a"><td><object data="https://static.hindawi.com/articles/acisc/volume-2016/3713918/figures/3713918.fig.005a.svgz" name="3713918.fig.005a" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(a) </b>Clockwise</td></tr><tr class="fig-image" id="b"><td><object data="https://static.hindawi.com/articles/acisc/volume-2016/3713918/figures/3713918.fig.005b.svgz" name="3713918.fig.005b" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(b) </b>Anticlockwise</td></tr></table>

<div>The comparison of fuel consumption of driving clockwise and anticlockwise.</div>

Applied Computational Intelligence and Soft Computing

fig5

Figure 5

Figure 5: An Efficient Two-Objective Hybrid Local Search Algorithm for Solving the Fuel Consumption Vehicle Routing Problem 