Putting Continuous Metaheuristics to Work in Binary Search Spaces

Table 5

Summary of two-step binarization methods.

Binarization techniques	Metaheuristic	Problem	References
Transfer function	Firefly	Set covering problem	[132, 133]
		Synthesis of thinned planar antenna array	[134]
		Nonlinear binary optimization	[135]
		Network and reliability constrained unit commitment problem	[78]
		Permutation flow-shop scheduling problem	[136]
	Algae	Knapsack problem	[41]
	Artificial bee colony	Set covering problem	[96]
		Thermal unit commitment	[137]
	Cuckoo search	Bulk power system	[37]
	Differential evolutionary	Multiagent systems	[29]
		Knapsack problems	[30]
	Binary bat	Unimodal, multimodal	[138]
		Traveling Salesman	[139]
	Gravitational search	Unimodal, multimodal	[80, 138]
	Open source development model	Combinatorial problems	[140]
	Particle swarm	Optimize sizing of capacitor banks	[82]
		Bulk power system	[81]
		Network reconfiguration	[83]
		Unit commitment problem	[31]
		Knapsack problems	[41, 74]
	Teaching-learning based	Designing plasmonic nanobipyramids based on absorption coefficient	[85]
	Electromagnetism-like method	Traveling sales	[141]
	Catfish	Feature selection	[142]
Great value priority	Binary Bat	Antenna positioning problem	[87]
	Particle swarm	Quadratic assignment problem	[86]
Angle modulation	Particle swarm	N-queens	[92]
		Binary problems	[89]
		Finding defensive islands of large-scale power systems	[90]
	Differential evolution	Knapsack problems	[93]
		Binary problems	[94]
	Artificial bee colony	Binary problems	[96]
		Feature selection	[95]
	Binary bat	Graph coloring	[143]
		Antenna positioning problem	[87]