$(1)$ Solve the attached problems $($Problem $1,$ Problem $2$ and Problem $3)$ by using the algorithm you chose. For each problem, you must follow the following steps:

Step$1$: Try to find a best parameter set $($i$.$e$.$ population size, iteration limit$,$ etc.$).$

Step$2$: By using the parameters obtained in step $1,$ solve the problem for $25$ times $($Note: Values of the objective function and decision variables must be displayed on the command window at the end of each trial$).$

Step$3$: Give the best, worst and average solutions among the $25$ trials. Besides, compute the standard deviation of those.

Step$4$: For the best solution among the $25$ trials, give the values of decision variables and prove that this solution is feasible.

$(2)$ Prepare a project report including followings;

An introducton section $($briefly exlain what you've done in this project$).$

A summary of the algorithm you used in your Project $($basic explanations, algorithm steps, flow$-$charts, etc$)$

A section including all results obtained in Step$1,$ Step$2,$ Step$3$ and Step$4$ given above for each problem.

A Conclusion Section

References

$(3)$ Upload the followings to the assignment published on ESOGU UZEM in a single $.$rar file with a name of $151220xxxxx\_$project.rar.

Project Report

MATLAB folders for each Problem, seperately.

Name each folder as Problem$1,$ Problem$2$ and Problem$3.$

In each folder, a script file with a name "main$\_$ProblemX.m$"$ must be exist.

Your algorithm must solve the corresponding problem when this script is run.

After a solution is obtained, values of the objective function and decision variables must be displayed on the command window.

This problem solve Reptile Search Algorithm use Matlab Code

The Paper in which your algorithm is proposed.Problem $2$:

minf$(x_1,x_2,x_3)={\displaystyle \underset{i=1}{\overset{3}{}}}{c}_i{x}_i^2+b_i{x}_i+a_i$

Subject To

${\displaystyle \underset{i=1}{\overset{6}{}}}{x}_i-210=100f_2(x_1,x_2,x_3)$

$x_i^{\text{m}\text{i}\text{n}}{x}_i{x}_i^{\text{m}\text{a}\text{x}},$AAi$=1,2,3$

and

$\backslash$table$[[i,1,2,3],[a_i,213\mathrm{.}10,11\mathrm{.}669,0\mathrm{.}00533],[b_i,200\mathrm{.}00,10\mathrm{.}333,0\mathrm{.}00889],[c_i,240\mathrm{.}00,10\mathrm{.}833,0\mathrm{.}00741],[x_i^{\text{m}\text{i}\text{n}},50\mathrm{.}00,37\mathrm{.}50,45\mathrm{.}00],[x_i^{\text{m}\text{a}\text{x}},200\mathrm{.}00,150\mathrm{.}00,180\mathrm{.}00]]$