Simulated annealing (SA) is a probabilistic technique for approximating the global optimum of a given function. Specifically, it is a metaheuristic to approximate global optimization in a large search space for an optimization problem. It is often used when the search space is discrete
optimized function :
f(x1,x2 )= -(sin(x1)cos(x2 )+4/5 exp(1-โ(x1^2+x2^2 )))
for -10<x1<10 and -10<x2<10
These instructions will get you a copy of the project up and running on your local machine for development and testing purposes. See deployment for notes on how to deploy the project on a live system.
- To get the result
- Change directory to the folder where the file is located
- Run main.m
- To get the plot of result
- Change directory to the folder where the file is located
- Run plot. m
What things you need to install the software and how to install them
Matlab
- Dandi Trianta Barus - Initial work - dandibaroes
This project is licensed under the GNU General Public License v3.0 - see the LICENSE file for details