Chaotic Honeybees Optimization Algorithms Approach for Traveling Salesperson Problem

Algorithm 3

Pseudocode for CSA.

	Chaotic initialization, giving an initial value to
	Generate the chaotic variables , i = 1, 2,…, n, using the logistic function
	The initial solution  = (, ,…,) is produced by the formula  =  + ( − ) × , i = 1,...,n.
	Initialize maximum temperature , minimum temperature and the number of iterations
	T =
	m = 0
	Set as the best solution
	Set as the best fitness
	While (T > )
	While (m ≤ )
	Generate a new solution  = (, ,…,) based on the formula  =  + α × ( − ) × , picking out i randomly and is delivered by the logistics map
	α = α × e^-β
	= f() −
	ΔE = f() − f()
	If ( ≤ 0)
	=
	If (ΔE ≤ 0)
	x m+1 =
	If (ΔE > 0)
	Accept status with probability
	m = m + 1
	End while
	=   + d, m = 0
	T = δ × T
	End while
	Deliver the best solution found and best fitness