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
C# QR Code Generator 4.0.2.2
Salesforce WordPress Customer Portal 3.2.0
Single Leg MLM 1.2.1
OzGIS 14.6
Quick Maps For Dynamics CRM 3.1
Job Board Software 4.2
PHP Real Estate Script 1.3.2
IP2Location Geolocation Database April.2019
dbForge Data Generator for Oracle 2.1
VisualNEO Web 2018.12.15
SentiMask SDK Trial 1.0.0
OrgChart JS 4.6.4
dotConnect for BigCommerce 1.8
FedEx Smart Shipping For Magento 1.0.0
Database Workbench Pro 5.6.2.311
Top Code
Job Board Software 4.2
AppControls 3.7.4
PileCard 1.0
ManageEngine ADAudit Plus 4.0
2D / 3D CAD Import .NET: DWG, DXF, PLT 8.0
Joyfax Broadcast 8.30.0225
ANSMTP SMTP email component 7.0
Polar SpellChecker Component 5.0
DBQwikEdit Pro 2.4
Javascript Code Improver 1.00
HTMLPad 2007 Pro 8.3
Oracle to MySQL database converter 4.0.1.6
JavaScript Spell Check 2.4
VISCOM Video Capture FLV MP4 SDK ActiveX 3.25
microOLAP Technologies LLC 1.9.6
Top Rated
VisualNEO Web 2018.12.15
Paste phpSoftPro 1.4.1
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
Availability Booking Calendar PHP 1.0
PHP GZ Blog Script 1.1
ATN Jobs Software 4.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: 183
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: 183



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