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

Algorithm 8

Hybrid genetic algorithm.

	Input: n, MaxGen.
	Output: BS and BT
	G0 = Generate initial population using Algorithm 1
	Evaluate ()
	BS = Find the best solution in this population
	while () do
	Gi = Population after selection using Algorithm 2
	fortodo
	Cj = offspring chromosome using crossover Algorithm 3
	Cj = mutated chromosome using mutation Algorithm 4
	Cj = improved chromosome using a local search Algorithm 5, 6, or 7
	end for
	= New population
	Evaluate ()
	= Find the best solution in this generation
	if () then
	= Best tour;
	else if () then
	Apply immigration
	end if
	end if
	end while
	Print BS and BT