Feasible Initial Population with Genetic Diversity for a Population-Based Algorithm Applied to the Vehicle Routing Problem with Time Windows

<table class="algorithm-group"><tr><td><table class="algorithm" id="alg3"><tr><td colspan="2">(1) <b>Begin_generation</b></td></tr><tr><td colspan="2">(2) Selection</td></tr><tr><td colspan="2">(3) Crossover</td></tr><tr><td colspan="2">(4) Modified Mutation operator</td></tr><tr><td colspan="2">(5) Population update</td></tr><tr><td colspan="2">(6) <b>End_generation</b></td></tr></table></td></tr></table>

<div>Reinsertion of diversity in a genetic algorithm.</div>

Mathematical Problems in Engineering

alg3

Algorithm 3

Algorithm 3: Feasible Initial Population with Genetic Diversity for a Population-Based Algorithm Applied to the Vehicle Routing Problem with Time Windows 

Algorithm 3 | Feasible Initial Population with Genetic Diversity for a Population-Based Algorithm Applied to the Vehicle Routing Problem with Time Windows 