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

Algorithm 4

Exchange mutation algorithm.

	Input : A chromosome,.
	Output: Muted chromosome.
	Generate a random number .
	if () then do
	Select randomly two different cities except dummy depots, suppose “city α” and “city β” in the chromosome.
	“city α” ↔ “city β,” provided that they do not violate the distance constraint.
	end if
	Return the mutated chromosome