Putting Continuous Metaheuristics to Work in Binary Search Spaces

Table 6

Summary of continuous-binary operator transformation.

Binarization techniques	Metaheuristic	Problem	Reference
Boolean approach	Particle swarm	Antenna design problem	[98, 99]
		Binary problems	[97]
	Binary artificial bee colony	Binary problems	[100]
Set-based approach	Particle swarm	Traveling salesman problem	[103]
		Multidimensional knapsack problem
		Vehicle routing problem	[101]
		Feature selection	[144]
	Jumping frogs	Combinatorial problems	[145]
	Water cycle	Truss structure	[146]
	Mine blast	Truss structure	[146]
	Gravitational	Traveling Salesman	[147]
	Imperialist competition	Transmission expansion Planning	[148]
	Invasive weed	Typical benchmark functions (Sphere, Rosenbrock, Rastrigin, Griewank)	[149]
	Social impact theory	Pattern recognition	[150]
Quantum binary approach	Particle swarm	Competitive facility	[151]
		Location problems
		Knapsack problem	[108]
		Power quality monitor placement method	[111]
	Differential evolution	Knapsack problem	[151]
		Combinatorial problems	[113]
		Image thresholding	[114]
	Cuckoo search	0-1 knapsack problem	[115]
		Bin packing problem	[116]
	Ant colony optimization	Image thresholding	[114]
	Harmony search	0-1 knapsack problem	[117]
	Monkey	0-1 knapsack problem	[118]
Binary method based on estimation of distribution	Particle swarm	Knapsack problem	[120]
	Differential Evolution	Optimization problems	[121, 122]
	Genetic	Economic dispatch problem	[106]
	Local search	Probabilistic traveling salesman problem	[123]
	Memetic	Probabilistic traveling salesman problem	[123]