Description: Simulated annealing (SA) is a generic probabilistic metaheuristic for the global optimization problem of applied mathematics, namely locating a good approximation to the global optimum of a given function in a large search space. It is often used when the search space is discrete (e.g., all tours that visit a given set of cities). For certain problems, simulated annealing may be more effective than exhaustive enumeration — provided that the goal is merely to find an acceptably good solution in a fixed amount of time, rather than the best possible solution.
File list (Check if you may need any files):
simAnealing\addrulefun.asv
...........\addrules.m
...........\alaki.asv
...........\computeMse.asv
...........\computeMse.m
...........\createFis.m
...........\mse.m
...........\partition.m
...........\plotting.m
...........\project1.asv
...........\project1.m
...........\search.asv
...........\search.m
...........\simAnnealing.asv
...........\simAnnealing.m
...........\testdata.m
...........\traindata.asv
...........\traindata.m
...........\WangMendel.asv
...........\WangMendel.m
Download