A New Adaptive Hungarian Mating Scheme in Genetic Algorithms

Table 1

Genetic parameter settings.

	TSP	Graph bisection problem
Representation	Order-based encoding	Assignment of one gene for each vertex (zero or one)
Recombination	Partially matched crossover [11]	One-point crossover
Mutation	Double-bridge kick move [12] (50%)	Random swap of some pairs of genes (50%)
Repair	—	Random repair until partition is feasible
Stopping criterion	1,000 generations	500 generations