How to find a better neighbor in simulated annealing?

2 次查看（过去 30 天）

snr matlb 2020-6-19

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/551236-how-to-find-a-better-neighbor-in-simulated-annealing

编辑： snr matlb 2020-6-19

I am using SA to minimize delay of each job. However, I use random solution in each iteration, so it may lead some move to different part of the solution space.

In each iteration, I generate random solution by controlling for-loop step. step is changing in each iteration and for each job i. So, I get a new solution as random generated one.

step = randi([lowerbound, upperbound],1);
for i = 20 : -step : 0
    
    delay_save = i;
end

I tried to generate neighbor solution for 1 job in each iteration. I made it as changing delay_saving between lower and upper bound for random selected job, and I leave the algorithm free to goes down or up. But, the algorithm, due to constraints, choose the going down, mostly. Then the solution goes worse, so I left generating neighbor. Manipulating is a choice but the algorithm is approaching to the more greedy one, that is not an wished approach.

However, if go with random solution in each iteration, it lost their SA meaning.

Is there any idea for both I will generate random solution in each iteration and the algorithm does not make giant jump from best feasible solution (bfs) to different part of the solution space? or Is there any idea to generate better neighbor? What are the neighbor techniques?