Algorithm 1 Pseudo-code for chaotic-based population initialization

Step 1: Generate standard random population P of N solutions with expression: $X_i=LB+(UB-LB)·rand(0,1),i=1,...N$, where $rand(0,1)$ is pseudo-random number drawn from the interval $[0,1]$. Step 2: Generate chaotic population $P^c$ of N individuals by mapping solutions from P to chaotic sequences using expressions (20) and (21). Step 3: Calculate fitness of all solutions from P and $P^c$. Step 4: Sort all solutions from $P\cup P^c$ according to fitness. Step 5: Select N best individuals from sorted set $P\cup P^c$ as initial population.