Resource download address ：https://download.csdn.net/download/sheziqiong/85695269
Resource download address ：https://download.csdn.net/download/sheziqiong/85695269
Catalog
1 Solve multiple minimal functions 2
1.1SA Algorithm 2
1.1.1 Algorithm flow 2
1.1.220 Statistical results of random experiments 3
1.1.3 Change curve of objective function 3
1.2GA Algorithm 6
1.2.1 code 6
1.2.2 Algorithm flow 6
1.2.3 Algorithm parameters 7
1.2.420 Statistical results of random experiments 7
1.2.5 Change curve of objective function 7
2TSP problem 8
2.1SA Algorithm 8
2.1.1 Algorithm flow 8
2.1.220 Statistical results of random experiments 8
2.2GA Algorithm 13
2.2.1 code 13
2.2.2 Algorithm flow 13
2.2.3 Algorithm parameters 13
2.2.420 Statistical results of random experiments 13
2.2.5 The result of an experiment 13
3 Algorithm characteristics 17
3.1 SA 17
3.2 GA 17
4TSP Visual applications 17
5 Experimental division 18
1 Solve multiple minimal functions
In solving multi extremum function problems , We need to find the maximum value of the function , We use function f (x0, x1) = −x1 ∗ sin(x0) −
x0 ∗ cos(x1) For example , Ask it in x0, x1 ∈ [−10, 10] The minimum in the interval .
Use MATLAB The drawn function image is shown in the figure 1 Shown , Its minimum value is available matlab The library function finds , about -17.394, At the same time, the function has multiple local minima .
The algorithm flow is basically similar to the above , The difference is ：
step 1 in , The initial temperature can be generated in two ways ： According to experience, the fixed initial temperature should be larger , The number of elements specified when randomly selecting a specified number to calculate variance is also much larger ; The initial solution is in discrete TSP The problem is the route of the city that the traveler passes through .
step 4 Update for status , stay TSP In question , You can do this by exchanging elements in two places 、 The elements between the two positions are in reverse order 、 Insert a specified sequence into the third position or mix the above operations according to probability to generate a new state , That is, the new travel routes .
Resource download address ：https://download.csdn.net/download/sheziqiong/85695269
Resource download address ：https://download.csdn.net/download/sheziqiong/85695269
