K-OPT

qq_64778795

于 2023-02-04 16:18:57 发布

阅读量170

点赞数

文章标签：算法

版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。

本文链接：https://blog.csdn.net/qq_64778795/article/details/128882438

版权

replace the notion of one favorable swaps by a search of a favorable sequence of swaps

do not search for the entire set of sequences but build one incrementally.In fact,it's a process from 2-opt to 3-opt to 4-opt to···and then stop and compare all of these costs and find the best opt.

find a good k dynamically at a fraction of the cost

explore a sequence of swaps of increasing sizes

steps:

choose a vertex $\text{[math]}$ and its edge $\text{[math]}$ =( $\text{[math]}$ , $\text{[math]}$ ) (cause this edge is long)

choose an edge $\text{[math]}$ =( $\text{[math]}$ , $\text{[math]}$ ) with d( $\text{[math]}$ )<d( $\text{[math]}$ )

if none exist,restart with another vertex

else,we have a solution by removing the edge ( $\text{[math]}$ , $\text{[math]}$ ) and connecting ( $\text{[math]}$ , $\text{[math]}$ )

compute the cost but do not connect (still, ( $\text{[math]}$ , $\text{[math]}$ ) is long)

instead, we restart the above process with $\text{[math]}$ and its pretended edge ( $\text{[math]}$ , $\text{[math]}$ )

now it's like 3-opt, but still we don't want to stop here.do the above process (i.e. the k-opt algorithm) again and again and again···

now it's like 4-opt. And we can stop here to get a good sequence because we can't find a shorter edge from $\text{[math]}$ .

OK,so now we have done our first iteration, we can then choose another vertex and start the second iteration···

评论

被折叠的条评论为什么被折叠?

到【灌水乐园】发言

查看更多评论

添加红包

成就一亿技术人!

hope_wisdom

发出的红包

实付元

使用余额支付

点击重新获取

扫码支付

钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。