SA ALGORITHM:

POWELL’S METHOD:

1) Select an initial solution S.

2) Select an initial temperature

3) While lower bound, do the following:

3.1) Perform the following L times:

(i) Select a random neighbour S¹ of S

(ii)

(iii) If (downhill move); set.

(iv) If (uphill move), set with probability,

3.2) Set (reduce temperature by cooling factor).

4) Return to S in step 1.

1) Select a starting point p₀ (in N-dimension) and set.

2) Minimize the function f in each of the N search directions. The function value at the end of each search is. Note:

3) Set and compute

4) If then replace the search direction of maximum change to.

5) Repeat steps 2 - 4 until the algorithm converges to the required global optimum [28] .