Search
Code Directory
 ASP
 ASP.NET
 C/C++
 CFML
 CGI/PERL
 Delphi
 Development
 Flash
 HTML
 Java
 JavaScript
 Pascal
 PHP
 Python
 SQL
 Tools
 Visual Basic & VB.NET
 XML
New Code
Spire.PDF for Java 2.7.8
Database Workbench Pro 5.6.10.0
The C# PDF Library 2020.1.5
CAD-Viewer 3DVBVIEW V4
dotConnect for SQLite 5.15
LuaStudio 9.92
EntityDAC 2.3
Devart ODBC Driver for QuickBooks 2.0
phpEnter 5.1.
Udemy Clone script 2.01
VisualNEO Web 19.11.7
VisualNEO for Windows 19.4.29.0
SentiVeillance SDK Trial 7.3
Devart ODBC Driver for PostgreSQL 3.2
SecureBridge 9.2
Top Code
SecureBridge 8.0
dotConnect for SQLite 5.9
EntityDAC 1.6
Database Workbench Pro 5.6.10.0
ATN Site Builder 3.0
ATN Resume Finder 2.0
The C# PDF Library 1.0
Devart ODBC Driver for PostgreSQL 3.2
Aglowsoft SQL Query Tools 8.2
Classified Ad Lister 1.0
Solid File System OS edition 5.1
ADO.NET Provider for ExactTarget 1.0
Deals and Discounts Website Script 1.0.2
SentiVeillance SDK Trial 7.3
A-star Search Algorithm 1.1
Top Rated
phpEnter 5.1.
Single Leg MLM 1.2.1
Azizi search engine script PHP 4.1.10
Paste phpSoftPro 1.4.1
Extreme Injector 3.7
Deals and Discounts Website Script 1.0.2
ADO.NET Provider for ExactTarget 1.0
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
Invoice Manager by PHPJabbers 3.0
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
ATN Site Builder 3.0
Simulated Annealing Optimization 1.0
File ID: 83389






Simulated Annealing Optimization 1.0
Download Simulated Annealing Optimization 1.0http://www.mathworks.comReport Error Link
License: Shareware
File Size: 10.0 KB
Downloads: 184
Submit Rating:
Simulated Annealing Optimization 1.0 Description
Description: Simulated annealing is an optimization algorithm that skips local minimun. It uses a variation of Metropolis algorithm to perform the search of the minimun. It is recomendable to use it before another minimun search algorithm to track the global minimun instead of a local ones.

Usage: [x0,f0]sim_anl(f,x0,l,u,Mmax,TolFun)

INPUTS:
f = a function handle
x0 = a ninitial guess for the minimun
l = a lower bound for minimun
u = a upper bound for minimun
Mmax = maximun number of temperatures
TolFun = tolerancia de la funcidoDln

OUTPUTS:
x0 = candidate to global minimun founded
f0 = value of function on x0

Example:

The six-hump camelback function:

camel= @(x)(4-2.1*x(1).^2+x(1).^4/3).*x(1).^2+x(1).*x(2)+4*(x(2).^2-1).*x(2).^2;

has a doble minimun at f(-0.0898,0.7126) = f(0.0898,-0.7126) = -1.0316

this code works with it as follows:

[x0,f0]=sim_anl(camel,[0,0],[-10,-10],[10,10],400)

and we get:
x0=[-0.0897 0.7126]

License: Shareware

Related: funci, tolerancia, outputs, candidate, founded, tolfun, temperatures, Bound, upper, maximun

O/S:BSD, Linux, Solaris, Mac OS X

File Size: 10.0 KB

Downloads: 184



More Similar Code

Simulated Annealing Optimization m-file The program set can be used to solve TRAVELING SALESMAN PROBLEMS
from the TSPLIB.



anneal Minimizes a function with the method of simulated annealing (Kirkpatrick et al., 1983)

ANNEAL takes three input parameters, in this order:

LOSS is a function handle (anonymous function or inline) with a loss function,...



Adaptive Simulated Annealing (ASA) is a C-language code that finds the best global fit of a nonlinear cost-function over a D-dimensional space. ASA has over 100 OPTIONS to provide robust tuning over many classes of nonlinear stochastic systems.



Two programs are attached: sa_demo demonstrates how the simualted annealing works for simple functions, while sa_mincon solves a welded beam design problem using simulated annealing, which can easily be used to solve other constrained optimization...



Java framework for applying meta-heuristic (multi-objective) optimization algorithms like an Evolutionary Algorithm, Particle Swarm Optimizer, Differential Evolution, or Simulated Annealing to arbitrary optimization problems.(visit:...



Drools Planner does automated planning. It solves a planning problem while respecting the constraints as much as possible. It implements tabu search, simulated annealing and more.

Use cases:
Bin packaging
Employee shift...



simulatedannealing() is an optimization routine for traveling salesman problem. Any dataset from the TSPLIB can be suitably modified and can be used with this routine. A detailed description about the function is included in...



GODLIKE (Global Optimum Determination by Linking and Interchanging Kindred Evaluators) compiles various population-based global optimization schemes.

It handles both single- and multi-objective optimization, simply by adding additional...



The OptControlCentre (OCC) is an user-friendly software package for the optimization of dynamic systems in energy and chemical engineering. Optimization methods include SQP methods as well as a stochastic approach using Simulated Annealing.



Case of study: "Capacity Energy Storage Solution".
Dual problem of SMES, replacing inductors with capacities.

User Review for Simulated Annealing Optimization
- required fields
     

Please enter text on the image