TSP algorithms based on simulated annealing algori
2016-08-23
0 0 0
no vote
Other
Earn points
Simulated annealing (Simulated Annealing, referred to as SA) traditional methods for solving TSP problems intractable provides an effective approach and general framework, and gradually developed into an iterative Adaptive heuristic probabilistic search algorithms. To solution different of nonlinear problem; on not micro even not continuous of function optimization, SA can to larger probability obtained global excellent resolve; has strong of robustness, and global convergence sex, and implied parallel sex and the widely of adaptability; and can processing different type of optimization design variable (discrete of, and continuous of and mixed type of); not needs any of auxiliary information, on target function and constraint function no any requirements. Using the Metropolis algorithm and the appropriate control of temperature decline, in the optimization problem has a strong competitive edge, this case study is based on the simulated annealing algorithm of TSP.
Click the file on the left to start the preview,please
!The preview only provides 20% of the code snippets, the complete code needs to be downloaded
Report
matlab
算法
tsp
基于
模拟
退火
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