Simulated annealing algorithm matlab sample
2016-08-23
0 0 0
no vote
Other
Earn points
Application background
Salesman Problem has (TSP) been an interesting problem for a long TravelingIn classical optimization techniques which are based on linear and nonlinear timeTSP can be described as follows: Given a number of cities to visit programming.Their distances from all other cities know an, optimal travel route has to be andSo that each city is visited one and only once with the least possible distance foundThis is a simple problem with handful of cities but becomes complicated traveled.The number increases. asKey Technology
Are several well know classical methods for finding a near optimal solution ThereLinear and nonlinear programming for TSP S. 'Simulated Annealing is not usingOn any of the classical optimization techniques but is based on heuristics basedAnnealing process. Based on the motivation from how crystalline structures are fromFrom annealing process a, heuristic method called simulated annealing was formedAnd had a lotmatlab
算法
模拟
示例
退火
Related Source Codes
GMSK Linear Receiver
0
0
no vote
NSGA-II algorithm
0
0
no vote
NSGA-III multi-objective optimization algorithm
0
0
no vote
Compressed sensing example
0
0
no vote
CFAR detector example
0
0
no vote
No comment