Hybrid Genetic Algorithms for the Asymmetric Distance-Constrained Vehicle Routing Problem

<table class="table-group" id="tab6"><tr><td><table class="table"><tr><td class="thead-hr" colspan="2"><hr/></td></tr><tr class="thead"><td class="align_left">Notation</td><td class="align_center">Description</td></tr><tr><td class="thead-hr" colspan="2"><hr/></td></tr><tr><td class="align_left">INST</td><td class="align_center">Name of a TSPLIB instance</td></tr><tr><td class="align_left">Opt</td><td class="align_center">Optimal solution</td></tr><tr><td class="align_left">AS</td><td class="align_center">Average solution in 20 runs</td></tr><tr><td class="align_left">SD</td><td class="align_center">Standard deviation of obtained solutions</td></tr><tr><td class="align_left">AT</td><td class="align_center">Average computational time in seconds in 20 runs</td></tr><tr><td class="align_left">AI</td><td class="align_center">Average percentage of improvement of average solution obtained by a HGA over average solution obtained by simple GA</td></tr><tr><td class="align_left">Max<sub><i>i</i></sub></td><td class="align_center">The maximum distance traveled by a vehicle among <i>m</i> vehicles in a route</td></tr><tr class="table-tr"><td colspan="2"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

<div>Description of different notations used in the tables that contain results.</div>

Mathematical Problems in Engineering

tab6

Table 6

Table 6: Hybrid Genetic Algorithms for the Asymmetric Distance-Constrained Vehicle Routing Problem 